[Solved]Write Complete Program Library Sort Gapped Insertion Sort Output 3 Steps 1 Binary Search 2 Q37266974

write a complete program of Library sort or (gapped insertionsort) with output.

3 steps:

1. binary search

2. insert element

3. rebalancing

below is the psuedocode of the library sortalgorithm(consider this)

Rebalance(Array S, Integer iniLen, Integer finLen)k = finLen-1step = finLen/iniLenfor j=iniLen-1 to 0: S[k] = S[j] S[j] = NONE k = k-stepend forLibrarySort(Array A, Integer n, Float epsilon, Array S) goal = 1 pos = 0 sLen = (Integer)(1+epsilon)*n while pos<n://For each round do this: for i=1 to goal://Insert ‘goal’ elements to the sorted array S //Search a position to insert A[pos] insPos = binarySearch(A[pos], S, sLen) if not IS_EMPTY(S[insPos]): //Move elements to the right or the left in order to free //insPos freeSpace(insPos, S, sLen)end if S[insPos] = A[pos]//Insert new element pos = pos + 1 if pos>n://All elements have been inserted return LibrarySort end if end for prevLen = sLen sLen = min( (2+2*epsilon)*goal, (1+epsilon)*n ) //Rebalance array S Rebalance(S, prevLen, sLen) goal = goal * 2 end while

Expert Answer

---

Answer to write a complete program of Library sort or (gapped insertion sort) with output. 3 steps: 1. binary search 2. insert ele… . . .