Skip to content

Tag Archives: ShellSort

Shell Sort is mainly a variation of Insertion Sort. The idea of shell sort is to allow the exchange of far items. In order to… Read More
Given an array, arr[] of N elements, where each element is at most K away from its target position, the task is to devise an… Read More
Given a doubly-linked list containing N nodes, where each node is at most K away from its target position in the list, the task is… Read More
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:… Read More
What is the best case complexity for shell sort? (A) O(1) (B) O(n) (C) O(logn) (D) O(n logn) Answer: (B) Explanation: Quiz of this QuestionPlease… Read More