Shell-Metzner Sort
Given an array arr[] of N integers, the task is to sort the array using Shell-Metzner sort.
Input: arr[] = {0, -2, 8, 5, 1}
Output: -2 0 1 5 8Input: arr[] = {4, 5, 6, 1, 100000, 1000}
Output: 1 4 5 6 1000 100000
Prerequisite: Shell Sort
The Shell-Metzner sort is an adaptation of the Shell sort by Marlene Metzner. The Shell-Metzner Sort uses five indices to check which cells to swap. The Metzner version starts with a step size equal to half the length of the array, with each pass increasing the number of comparisons quadratically.
Below is the implementation of Shell-Metzner sort:
C++
// C++ implementation of Shell-Metzner Sort #include <bits/stdc++.h> using namespace std; // Function to swap two elements void swap(int& a, int& b) { int temp = a; a = b; b = temp; } // Function to sort arr[] using Shell Metzner sort void sort_shell_metzner(int arr[], int n) { // Declare variables int i, j, k, l, m, temp; // Set initial step size to // the size of the array m = n; while (m > 0) { // Step size decreases by half each time m /= 2; // k is the upper limit for j k = n - m; // j is the starting point j = 0; do { // i equals to smaller value i = j; do { // l equals to larger value l = i + m; // Compare and swap arr[i] with arr[l] if (arr[i] > arr[l]) { swap(arr[i], arr[l]); // Decrease smaller value by step size i -= m; } else break; } while (i >= 0); // Increment the lower limit of i j++; } while (j <= k); } } // Function to print the contents of an array void printArray(int arr[], int n) { for (int i = 0; i < n; i++) cout << arr[i] << " "; } // Driver code int main() { int arr[] = { 0, -2, 8, 5, 1 }; int n = sizeof(arr) / sizeof(arr[0]); // Sort the array using Shell Metzner Sort sort_shell_metzner(arr, n); // Print the sorted array printArray(arr, n); return 0; } |
chevron_right
filter_none
Java
// Java implementation of Shell-Metzner Sort class GFG { // Function to swap two elements static int[] swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; return arr; } // Function to sort arr[] using Shell Metzner sort static void sort_shell_metzner(int arr[], int n) { // Declare variables int i, j, k, l, m, temp; // Set initial step size to // the size of the array m = n; while (m > 0) { // Step size decreases by half each time m /= 2; // k is the upper limit for j k = n - m; // j is the starting point j = 0; do { // i equals to smaller value i = j; do { // l equals to larger value l = i + m; // Compare and swap arr[i] with arr[l] if (l < n && arr[i] > arr[l]) { swap(arr, i, l); // Decrease smaller value by step size i -= m; } else { break; } } while (i >= 0); // Increment the lower limit of i j++; } while (j <= k); } } // Function to print the contents of an array static void printArray(int arr[], int n) { for (int i = 0; i < n; i++) { System.out.print(arr[i] + " "); } } // Driver code public static void main(String[] args) { int arr[] = {0, -2, 8, 5, 1}; int n = arr.length; // Sort the array using Shell Metzner Sort sort_shell_metzner(arr, n); // Print the sorted array printArray(arr, n); } } /* This code contributed by PrinciRaj1992 */ |
chevron_right
filter_none
Python3
# Python3 implementation of Shell-Metzner Sort # Function to sort arr[] using Shell Metzner sort def sort_shell_metzner( arr, n): # Set initial step size to # the size of the array m = n; while (m > 0): # Step size decreases by half each time m //= 2 # k is the upper limit for j k = n - m # j is the starting point j = 0 while(j < k): # i equals to smaller value i = j while(i >= 0): # l equals to larger value l = i + m # Compare and swap arr[i] with arr[l] if (arr[i] > arr[l]): arr[i], arr[l]=arr[l],arr[i] # Decrease smaller value by step size i -= m else: break # Increment the lower limit of i j += 1 # Function to print the contents of an array def printArray(arr, n): for i in range( n): print( arr[i], end= " ") # Driver code if __name__ =="__main__": arr = [ 0, -2, 8, 5, 1 ] n = len(arr) # Sort the array using Shell Metzner Sort sort_shell_metzner(arr, n) # Print the sorted array printArray(arr, n) # This code is contributed by chitranayal |
chevron_right
filter_none
C#
// C# implementation of Shell-Metzner Sort using System; class GFG { // Function to swap two elements static int[] swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; return arr; } // Function to sort arr[] using Shell Metzner sort static void sort_shell_metzner(int []arr, int n) { // Declare variables int i, j, k, l, m, temp; // Set initial step size to // the size of the array m = n; while (m > 0) { // Step size decreases by half each time m /= 2; // k is the upper limit for j k = n - m; // j is the starting point j = 0; do { // i equals to smaller value i = j; do { // l equals to larger value l = i + m; // Compare and swap arr[i] with arr[l] if (l < n && arr[i] > arr[l]) { swap(arr, i, l); // Decrease smaller value by step size i -= m; } else { break; } } while (i >= 0); // Increment the lower limit of i j++; } while (j <= k); } } // Function to print the contents of an array static void printArray(int []arr, int n) { for (int i = 0; i < n; i++) { Console.Write(arr[i] + " "); } } // Driver code public static void Main(String[] args) { int []arr = {0, -2, 8, 5, 1}; int n = arr.Length; // Sort the array using Shell Metzner Sort sort_shell_metzner(arr, n); // Print the sorted array printArray(arr, n); } } // This code has been contributed by 29AjayKumar |
chevron_right
filter_none
PHP
<?php // php implementation of Shell-Metzner Sort // Function to sort arr[] using Shell Metzner sort function sort_shell_metzner($arr, $n) { // Set initial step size to // the size of the array $m = $n; while ($m > 0) { // Step size decreases by half each time $m = $m / 2; // k is the upper limit for j $k = $n - $m; // j is the starting point $j = 0; do { // i equals to smaller value $i = $j; do { // l equals to larger value $l = $i + $m; // Compare and swap arr[i] with arr[l] if ($arr[$i] > $arr[$l]) { $temp = $arr[$i]; $arr[$i] = $arr[$l]; $arr[$l] = $temp; // Decrease smaller value by step size $i -= $m; } else break; } while ($i >= 0); // Increment the lower limit of i $j++; } while ($j <= $k); } return $arr ; } // Function to print the contents of an array function printArray($arr, $n) { for ($i = 0; $i < $n; $i++) echo $arr[$i], " "; } // Driver code $arr = array( 0, -2, 8, 5, 1 ); $n = count($arr); // Sort the array using Shell Metzner Sort $result_array = sort_shell_metzner($arr, $n); // Print the sorted array printArray($result_array, $n); // This code is contributed by Ryuga ?> |
chevron_right
filter_none
Output:
-2 0 1 5 8
Time Complexity: O(n2)
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
Recommended Posts:
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?
- Add elements in start to sort the array | Variation of Stalin Sort
- Bucket Sort To Sort an Array with Negative Numbers
- Program to sort an array of strings using Selection Sort
- Insertion sort to sort even and odd positioned elements in different orders
- Java Program for Odd-Even Sort / Brick Sort
- Odd Even Transposition Sort / Brick Sort using pthreads
- Sort an Array which contain 1 to N values in O(N) using Cycle Sort
- Serial Sort v/s Parallel Sort in Java
- sort() vs. partial_sort() vs. nth_element() + sort() in C++ STL
- C/C++ Program for Odd-Even Sort / Brick Sort
- Quick Sort vs Merge Sort
- Merge Sort vs. Insertion Sort
- Odd-Even Sort / Brick Sort
- Sort all even numbers in ascending order and then sort all odd numbers in descending order
- How to sort an Array in C# | Array.Sort() Method Set – 2
- How to sort a list in C# | List.Sort() Method Set -1
- std::sort() in C++ STL
- Strand Sort
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
- Real-time application of Data Structures
- Count of substrings of length K with exactly K distinct characters
- Replace every element of array with sum of elements on its right side
- Longest subarray whose elements can be made equal by maximum K increments
- Finding Median of unsorted Array in linear time using C++ STL