JAVA中的这种排序叫什么？

Question

Hope that you guys are having a good day!

I'm new to Java so I'm still getting the hang of it.

There is a sorting algorithm which I do use more often than not

for(int i=0; i<array.length; i++){
    for(int j=i; j<array.length; j++){
        if(array[j] < array[i]){
            int temp = array[i];
            array[i] = array[j];
            array[j] = temp;
        }
    }
}

Explanation: The outer loop first use the first element of the array and start comparing that to the rest of the elements inside the list, if it is larger than one of the element, swap it.

For example, we got an array 12, 5, 14, 8, 3

We have array[0] as 12. Comparing that to array[1] in the inner loop, since 5<12 we swap them. The inner loop continues until array[4] where array[4] < array[0] now we have 3 as the smallest element in the array in the right place

Rinse and repeat with the rest of the elements

What is this type of sorting? Because it doesn't seem to fit in Selection Sort or Insertion Sort let alone Bubble Sort.

Thanks for helping!

Answer 1

This is most definitely selection sort since at the end you're swapping a higher number near the beginning for a lower number further away. Most of the time if a sort method has a swap at the end it's selection.

Answer 2

This is a kind of bubble sort . A bubble sort would compare array[j-1] with array[j] , not array[i] with array[j] , but the overall effect is similar: The algorithm moves all larger elements to the right simultaneously, whereas a bubble sort moves each element in turn to the right until a larger element is encountered.

It is not a selection sort, which starting at index 0, finds the smallest element from index onwards then swaps it with the element at index, then increments index and repeats for all indexes.

Your code is a java implementation of a simplified and unoptimized version of this pseudocode .