C++ Program for ShellSort
In shellSort, we make the array h-sorted for a large value of h. We keep reducing the value of h until it becomes 1. An array is said to be h-sorted if all sublists of every h’th element is sorted.
CPP
#include <iostream>
void shellSort( int arr[], int n)
{
for ( int gap = n / 2; gap > 0; gap /= 2) {
for ( int i = gap; i < n; i += 1) {
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
}
void printArray( int arr[], int n)
{
for ( int i = 0; i < n; i++)
std::cout << arr[i] << " " ;
std::cout << "\n" ;
}
int main()
{
int arr[] = { 12, 34, 54, 2, 3 };
int n = sizeof (arr) / sizeof (arr[0]);
std::cout << "Array before sorting: \n" ;
printArray(arr, n);
shellSort(arr, n);
std::cout << "Array after sorting: \n" ;
printArray(arr, n);
}
|
Output:
Array before sorting:
12 34 54 2 3
Array after sorting:
2 3 12 34 54
Time Complexity: O(n2)
Auxiliary Space: O(1)
Please refer complete article on ShellSort for more details!
Last Updated :
10 Jun, 2022
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...