Question

Note Assume that the data structure is a O-based index.
Pseudocode
N = length of HackArr
for i from 1 to N-1 do
j = i
while Gso) and (hackArr[0] < HackArr[j-1]) do
k = HackArra)
HackArr() = HackArr(1-1)
HackArr(-1) = k
j = 3-1
end-do
end - for​

Answer 1

Answer:

Note Assume that the data structure is a O-based index.

Pseudocode

N = length of HackArr

for i from 1 to N-1 do

j = i

while Gso) and (hackArr[0] < HackArr[j-1]) do

k = HackArra)

HackArr() = HackArr(1-1)

HackArr(-1) = k

j = 3-1

end-do

end - for.