Insertion Sort Algorithm Implementation

Question

Which of the following is an example of an insertion sort algorithm implementation?
 
```java
int[] arr = {12, 11, 13, 5, 6};
for (int i = 1; i < arr.length; i++) {
    int key = arr[i];
    int j = i - 1;
    while(j >= 0 && arr[j] > key) {
        arr[j+1] = arr[j];
        j--;
    }
    arr[j+1] = key;
}
```

Accepted Answer

int[] arr = {12, 11, 13, 5, 6}; for (int i = 1; i < arr.length; i++) { int key = arr[i]; int j = i - 1; while(j >= 0 && arr[j] > key) { arr[j+1] = arr[j]; j--; } arr[j+1] = key; }

Answer

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

Answer

Arrays.sort(arr);

Answer

int[] arr = {64, 25, 12, 22, 11}; for (int i = 0; i < arr.length - 1; i++) { int minIndex = i; for (int j = i + 1; j < arr.length; j++) { if(arr[j] < arr[minIndex]) { minIndex = j; } } int temp = arr[minIndex]; arr[minIndex] = arr[i]; arr[i] = temp; }

Rank	User	Correct Count	Attempt Count	Time	Score
#1	anvitakeni01	1	1	0m 00s	100
#2	ponneban000	0	2	0m 00s	-20
#3	bommasam000	2	5	12m 27s	-577

Question Leaderboard