Shell Sort
Shell sort is the most efficient of the O (n2) class of sorting algorithms.
The shell sort is "Diminishing Incremental Sort" better known as a comb sort to the unwashed programming masses. This algorithm makes multiple passes through the list and each time sorts a number of equally sized sets using the insertion sort. The size of the set to be sorted gets larger with each pass through the list until the set consist of entire list.
The items contained in each set are not contiguous rather. If there are I sets than a set is composed of every ith element. For example if there are 3 sets then of the first set would contain the elements located at position 1, 4, 7 and so on. The second set would contain the element located at position 2, 5, 8 and so on. While the third set would certain the items located at positions 3, 6, 9 and so on.8
Data Structure & Algorithms Assignment Help, Live Experts
Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.
ExpertsMind.com - Shell Sort Assignment Help, Shell Sort Homework Help, Shell Sort Assignment Tutors, Shell Sort Solutions, Shell Sort Answers, Sorting Assignment Tutors