Is this Bubble sort? How can I test it?

Question

Hi all,
Would someone please confirm that this snippet of code uses the bubble sort algorithm to sort the array it receives? Also, would there be any difference in functionality, efficiency or otherwise if I rewrote the same method using recursion? I would also appreciate it if someone could suggest some test cases to test this code as I am not sure how I can go about doing that.
Thank you very much.
public static void sort (float array[]){
        int mIndex = 0;
        float temp;
        int i = 0, j = 0;
        for (i=array.length-1; i>0; i--){
            mIndex = i;
            for (j=0; j<i; j++){
                if (array[j] > array[mIndex]){
                    mIndex = j;
            if (mIndex != i){
                temp = array;
array[i] = array[mIndex];
array[mIndex] = temp;

Answer 1

Moon123 wrote:
Hi all,
Would someone please confirm that this snippet of code uses the bubble sort algorithm to sort the array it receives? It doesn't. It uses [url http://en.wikipedia.org/wiki/Selection_sort]selection sort.
Also, would there be any difference in functionality, efficiency or otherwise if I rewrote the same method using recursion? Functionality: By definition, no. That is, if you reimplement the same task using a different algorithm, by definition, it still performs the same function.
Efficiency: No. The algorithm is still O(n^2). It will use more stack, and might be a tiny bit slower, but you won't be able to see the difference.
I would also appreciate it if someone could suggest some test cases to test this code as I am not sure how I can go about doing that.Create an array. Stick values into it in varying orders, including: correctly sorted, reverse sorted, random. Pass the array to this method. Compare the result to what you know it should be.