Converting Insertion Sort pseudocode to running Java code
Hello I been stuck on this for quite some time. I tried to convert this Insertion Sort pseudocode into java but dont get the right output. Here is the pseudocode.
1 for j ← 2 to length[A]
2 do key ← A[j]
3 ▹ Insert A[j] into the sorted sequence A[1 j - 1].
4 i ← j - 1
5 while i > 0 and A[i] > key
6 do A[i + 1] ← A[i]
7 i ← i - 1
8 A[i + 1] ← key
Re: Converting Insertion Sort pseudocode to running Java code
what output did you get and what output are you supposed to get? could you post the code that gives you the wrong output?