Question

Implement Library Sort which is a version of Insertion Sort with gaps to speed up the computation. If the pseudocode in Wikipedia (https://en.wikipedia.org/wiki/Library_sort) is not enough, you can download the research paper from (https://arxiv. org/pdf/cs/0407003.pdf).

Answer 1

#include <iostream> #include <algorithm> using namespace std; /* * This program reads in integers and sorts them using the library sort * function. The algorithm header provides the sorting function. */ const int MAX_NUM_INTS = 100; int main() {         int ints[MAX_NUM_INTS];    .                          // Read them in.         int i;         cout<<"Enter the size of the array: ";         cin>>n;         for(i = 0; i < n && cin >> ints[i]; ++i);         int numints = i;         // Sort them. The library sort algorithm wants a pointer to the         // the start of the data, and a pointer one past the end.         sort(ints, ints + numints);         // Print them.         cout << "After sorting the elements are: " << endl;         for(int i = 0; i < numints; ++i)                 cout << ints[i] << endl; }