Update InsertionSort.java

[Vsareen0]

Comments have been added for the implementation of insertion sort algorithm

[Shayan-Asgari]

In the insertion sort when you put "arr[j+1] = key;", I believe it is unnecessary since you have arr[j+1] = arr[j] where arr[i] will always be key.

Regards, Shayan Asgari

[Shayan-Asgari]

Inside the while loop there is also a problem. You do not do any swapping of integers, you are simply overriding the original array! You must have:
while (j>=0 && arr[j] > key)
{
int temp = arr[j]; // save arr[j] into a temporary
arr[j] = arr[j+1] ; // [J+1] will always be key
arr[j+1] = temp;
j = j--;
}
//arr[j+1] = key; <-------There is no need for this line

[Vsareen0]

Please have a look at modifications !

[Shayan-Asgari]

I believe the code is still incorrect. You are overriding some of the position values.

Regards,
Shayan Asgari