Question

c++ code for shell sort implementing singly-linked list. rearranging Node to sort.

Answer 1

#include <iostream>
using namespace std;
int ssort(int a[], int n)
{
// begins with a large gap (g), then reduce the gap.
for (int g = n/2; g > 0; g /= 2)
{
// gap sorted
for (int i = g; i < n; i += 1)
{
// add a[i] to the elements that have been gap sorted & save a[i] in temp and make a hole at position i
int temp = a[i];
// Push the earlier gap-sorted items up to the right one
int j;   
for (j = i; j >= g && a[j - g] > temp; j -= g)
a[j] = a[j - g];
a[j] = temp;
}
}
return 0;
}
  
int main() //main function
{
int a[] = {12, 34, 54, 2, 3}, i;
int n = sizeof(a)/sizeof(a[0]);
cout << "Input: \n";
for (int i=0; i<n; i++)
cout << a[i] << "-";
ssort(a, n);
cout << "\nOutput: \n";
for (int i=0; i<n; i++)
cout << a[i] << "-";
return 0;
}

Thanks, please give a thumbs up.