The implementation of InsertionSorter is wrong

Question

ramiroezequielalvarez opened this issue 3 years ago · 3 comments

The implementation of InsertionSorter is wrong. It's a copy of selection sort

Wikipedia example (InsersionSort)

i ← 1
while i < length(A)
j ← i
while j > 0 and A[j-1] > A[j]
swap A[j] and A[j-1]
j ← j - 1
end while
i ← i + 1
end while

currently InsertionSorter is equal to SelectionSorter

Answer 1 · 2022-06-02T14:19:05.000Z

Please open a PR, it's hard to read code when it's not formatted

Answer 2 · 2022-07-03T00:25:54.000Z

This issue is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 7 days.

Answer 3 · 2022-07-10T00:27:14.000Z

This issue was closed because it has been stalled for 7 days with no activity.