
	Where results make sense

Topic: Shell sort

Related Topics

Stupid sort

Comb sort

Bucket sort

Insertion sort

Pigeonhole sort

Counting sort

Bubble sort

Merge sort

Pancake sorting

Cocktail sort

Patience sorting

Introsort

Quicksort

Heapsort

Bogosort

In the News (Mon 23 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Shell sort - Wikipedia, the free encyclopedia
		Shell sort is a sorting algorithm that requires fewer than O(n²) comparisons and exchanges, on average.
		Shell sort is a generalization of insertion sort, with two observations in mind:
		Shell sort improves insertion sort by comparing elements separated by a gap of several positions.
	en.wikipedia.org /wiki/Shell_sort (738 words)

	Shell Sort (Site not responding. Last check: 2007-05-18)
		Shell sort, developed by Donald L. Shell, is a non-stable in-place sort.
		Shell sort improves on the efficiency of insertion sort by quickly shifting values to their destination.
		The central portion of the algorithm is an insertion sort with a spacing of h.
	epaperpress.com /sortsearch/shl.html (326 words)

	Sorting Algorithms (Site not responding. Last check: 2007-05-18)
		Some sorting algorithms are simple and intuitive, such as the bubble sort.
		Since the speed of a sort can vary greatly depending on what data set it sorts, accurate empirical results require several runs of the sort be made and the results averaged together.
		Even using the shell sort, users are going to be twiddling their thumbs if you try to sort much more than 10,000 data items.
	linux.wku.edu /~lamonml/algor/sort/sort.html (696 words)

	Shell sort
		It is important to note that the shell sort algorithm does not actually sort the data itself; it increases the effeciency of other sorting algorithms.
		Shell sort does not noticably benefit the faster algorithms (such as merge and quicksort), and in some cases will actually reduce their performance.
		Sort routines that rely on directly swapping elements are most effectively combined with a shell sort.
	goanna.cs.rmit.edu.au /~stbird/Tutorials/ShellSort.html (800 words)

	Michael Dipperstein's Sort Library
		Shell sort is an optimization of the insertion sort proposed by D. Shell.
		Shell observed that performing an insertion sort on sublist of items that are separated by some distance (an increment) may allow items to be moved further across the list.
		In the case of merge sort, the phases are a partition phase, and a merge phase.
	michael.dipperstein.com /sort/sort.html (1969 words)

	GameDev.net - Shell Sorting
		Shell Sort is the first sorting algorithm we'll look at that requires fewer than O(N2) comparisons and exchanges, on average.
		Shell Sort is similar to Insertion Sort, but it works by taking "bigger steps" as it rearranges values, gradually decreasing the step size down towards one.
		In the end, Shell Sort performs a regular Insertion Sort but by then, the array of data is guaranteed to be "almost sorted".
	www.gamedev.net /reference/articles/article300.asp (674 words)

	Shell Sort (Site not responding. Last check: 2007-05-18)
		The shell sort is a "diminishing increment sort", better known as a "comb sort" to the unwashed programming masses.
		The shell sort is by far the fastest of the N
		A sample C program that demonstrates the use of the shell sort may be downloaded here.
	linux.wku.edu /~lamonml/algor/sort/shell.html (449 words)

	Sorting with the Shell Sort
		The shell sort is an in-place sort because the items that are sorted occupy the same storage as the original items.
		It is described as a diminishing increment sort because it starts out with a certain increment number that reduces by half on each sorting pass until the increment reaches 1.
		The shell sort algorithm is categorized in the Big O(n^2) category along with the insertion sort, bubble sort, and selection sort but it is the faster and more efficient of the four.
	www2.hawaii.edu /~eguevara/ics211/ShellSort.html (1520 words)

	GameDev.net - Shell Sort
		This sorting algorithm is conceived by D. Shell (that's where it gets its name), and is inspired by the Insertion Sort's ability to work very fast on an array that is almost in order.
		Once all of the segments are sorted, Shell Sort redivides the array into less segments and repeat the the algorithm until at last that the number of segment equals one, and the segment is sorted.
		Shell Sort (Sorting the array A[size]) Determine the number of segments by dividing the number of cells by two.
	www.gamedev.net /reference/articles/article702.asp (396 words)

	Shell Sort (Site not responding. Last check: 2007-05-18)
		The function form of the running time for all Shell sort depends on the increment sequence and is unknown.
		Shell sort is the method of choice for many sorting application because it has acceptable running time even for moderately large files and requires only small amount of code that is easy to get working.
		Having said that, it is worthwhile to replace Shell sort with a sophisticated sort in given sorting problem.
	www.personal.kent.edu /~rmuhamma/Algorithms/MyAlgorithms/Sorting/shellSort.htm (166 words)

	Dr. Dobb's \| A Multifield Single-Pass Shell Sort Algorithm \| April 1, 2005 (Site not responding. Last check: 2007-05-18)
		I chose to use the shell sort algorithm and modify it to suit my needs because overall, it usually turns in the best times for worst and average cases, with the worst case beating the average case for sorting time.
		Sorting signed data is limited to a single byte, word, or dword in a field; otherwise, it will not sort properly.
		What I have added to the shell sort algorithm is the ability to sort on different types of fields, and to sort on more than one field in a single call to the sort procedure.
	www.ddj.com /184406069 (3039 words)

	[No title]
		Shell sort is a simple modification that improves performance significantly.
		Sort the complete binary tree (actually an array) so that it becomes a max-heap, thus the first element is always the biggest element.
		The bucket sort is an extreme version of the radix sort, where the number of bins is equal to the number of possible data values.
	www-viz.tamu.edu /faculty/parke/viza652f98/lecture_0921s.html (1884 words)

	Shell Sorts
		The trick in Shell Sort is to sort the subsequences of elements spaced k elements apart.
		It becomes clear that this version of Shell Sort becomes a kind of merge sort where pairs of subsequences are merged together.
		Thread 0 will sort the subarrays beginning at positions 0 and 4; thread 1, at positions 1 and 5; thread 2, at positions 2 and 6; and thread 3 the subarray beginning at position 3.
	www.tools-of-computing.com /tc/CS/Sorts/shell_sorts.htm (754 words)

	Shell Sort
		The Shell Sort algorithm was invited by Donald L. Shell in 1959.
		Finally in the last stage of the sort, most of our values will be in about the correct area for their final destination, and when we run the insertion sort with an increment of 1, it will go rather quickly because the values will not have to move too far.
		Shell Sort is not the quickest sorting method however; there are examples like quick sort, merge sort and heap sort which are able to sort lists many times faster; they are in a category of O(n log n), they can complete the same sorting in MUCH less time.
	www2.hawaii.edu /~schrepfe/ics211/webpage/p7.html (984 words)

	Shell Sort (Site not responding. Last check: 2007-05-18)
		Shell Sort subdivides the array of structures to be sorted into smaller pieces by selecting every n
		The efficiency of Shell Sort comes from the fact that it is able to move structures which are greatly offset from their final location rapidly with few key comparisons.
		Starting at the beginning of the array, take every delta structure and sort that group, as if it were a sub-array, using an insertion sort technique.
	www.cs.uah.edu /~rcoleman/Sorting/ShellSort.html (260 words)

	[No title]
		The sort method due to Donald Shell and known as Shell Sort compares elements that are far apart rather than adjacent pairs of elements in an attempt to make larger reductions in the inversion number.
		Each subsequence is sorted using insertion sort and then the process is repeated using the next increment.
		The insertion sorts done with the earlier increments allow elements to move toward their final spots by making large jumps.
	www.cise.ufl.edu /~sahni/dsaac/enrich/c2/shell.htm (518 words)

	Shell - Wikipedia, the free encyclopedia
		Animal shell, such as that of a mollusk or turtle, egg (biology), or a Nut (fruit) in plants,
		Electron shell, describing the structure of electron configuration in atoms
		Shell (computing), a type of computer user interface (for example Unix shell or DOS Shell)
	en.wikipedia.org /wiki/Shell (142 words)

	Program 4: Shell sort
		(3) uses shell sort to sort this set of integers and prints the sorted array.
		Shell sort should be implemented as a function in MIPS.
		The shell sort algorithm is shown in the following code.
	www.caip.rutgers.edu /~emmalily/teaching_files/fall2005-program4.htm (150 words)

	MIT OpenCourseWare \| Civil and Environmental Engineering \| 1.124J Foundations of Software Engineering, Fall 2000 \| ...
		In place sorting algorithms are the most memory efficient, since they require practically no additional memory. Linked list representations require an additional N words of memory for a list of pointers.
		The method derives its efficiency from the fact that insertion sort is able to exploit the order present in a partially sorted input file; input files with more order to them require a smaller number of exchanges. It is important to choose a good sequence of increments.
		Shell sort is usually a good starting choice for moderately large files N < 5000, since it is easily implemented.
	ocw.mit.edu /OcwWeb/Civil-and-Environmental-Engineering/1-124JFall2000/LectureNotes/detail/sorting.htm#Introduction (1794 words)

	[No title]
		The Shell sort is similar to the Bubble Sort but compares items a distance apart in an array (called the gap), instead of adjacent items.
		Although the Shell sort is not recursive, we can use a recursive relation to determine the starting gap.
		The complexity of the Shell sort cannot be expressed by a single function, but is always better than n^2 but not as efficient as nlogn.
	www.tcnj.edu /~vanhise/cs2les20.doc (129 words)

	Sorting
		Examples of elementary sorting algorithms are: selection sort, insertion sort, shell sort and bubble sort.
		This is another simple sorting algorithm, which is based on the principle used by card players to sort their cards.
		Sort them (by direct comparison) so that the median of the three is in a[middle] and the largest is in a[right].
	web.mit.edu /course/1/1.124/LectureNotes/sorting.html (1734 words)

	Sorting -- Getting it Straight
		Another variant of insertion sorting was proposed by Donald Shell in 1959 that allows insertion of items that are far apart with few comparisons.
		A refinement of bubble sort is to reverse direction on each pass of bubble sort.
		Distribution counting sort is stable: numbers with the same value appear in the output array in the same order as they were in the input array.
	www.cs.fit.edu /~wds/classes/cse5081/Sort/sort/sort.html (5028 words)

	[No title]
		Sorting and Searching A sort is an algorithm for ordering the elements of an array.
		Strings are often sorted based on the ANSI values of the characters or alphabetically ignoring case, but other measures are possible.
		The shell sort also uses nested loops, but in this case their are three loops and only the inner- most loop can use ForNext structure.
	www.cs.sfu.ca /cs/CC/110/sbarney/LectureNotes/lecture7/l7_1.txt (1304 words)

	Arrays in C++ - Shell Sort
		(named after its inventor D. Shell) is similar to the bubble sort, but instead of adjacent elements being repeatedly compared, elements that are a certain distance away from each other (d positions away) are repeatedly compared.
		sort continues until d = 1 and the pass occurs without any swaps.
		This sorting process, with its comparison model, is an efficient sorting algorithm.
	mathbits.com /MathBits/CompSci/Arrays/Shell.htm (265 words)

	Workshop on Scheme: Sorting by Shell's algorithm (Site not responding. Last check: 2007-05-18)
		Since the Shell sort makes frequent non-sequential accesses to elements of the data structure, only a (destructive) vector version is offered here.
		The body of the Shell sort is a nested loop.
		The inner loop then runs through the positions in the vector, effecting a mini-insertion sort on the subsequences of the vector consisting of positions differing by multiples of the gap.
	www.math.grin.edu /~stone/events/scheme-workshop/shellsort.html (248 words)

	Project 12 (Site not responding. Last check: 2007-05-18)
		This project explores the time Shell Sort requires and compares it to that of Insertion Sort, on which Shell Sort is based.
		The functions that implement the two sorting algorithms will also count the numbers of comparisons of array elements that they perform, and the main program will report the values as sorted by each sorting algorithm and the numbers of comparisons each performed in sorting the values.
		As in Project 10, augment the Insertion Sort and Shell Sort functions presented in class with a reference parameter that returns the number of comparisons the functions perform.
	condor.stcloudstate.edu /~julstrom/cs201/projects/p12f01.html (579 words)

	Shell Sort
		The program from the test is a sort, called Shell Sort (named after Donald Shell who invented it in 1959).
		It does this by sorting using sets based on modular equality (p%incr = q%incr), or by "skipping" by increment through the array.
		By sorting sets first, we know when we do the second pass we will only need to move any item by a maximum of 2 places.
	spot.pcc.edu /~eodekirk/cs162/shellSort.html (785 words)

	fejj's log: shell sort (Site not responding. Last check: 2007-05-18)
		The Shell sort algorithm is designed to move items over large distances each iteration.
		The nice thing about Shell Sort is that, while the increment table is a complete mystery, the algorithm itself is quite simple and well within our grasp.
		Note: As requested, I have exported all of my sorting articles into a single sorting.pdf document and have placed it on my website at http://primates.ximian.com/~fejj/doc/sorting.pdf and will keep this file updated as I write new articles on sorting algorithms.
	primates.ximian.com /~fejj/blog/archives/000014.html (617 words)

	R: Sorting or Ordering Vectors (Site not responding. Last check: 2007-05-18)
		Sort (or order) a vector or factor (partially) into ascending (or descending) order.
		Any values smaller than these values are guaranteed to have a smaller index in the sorted array and any values which are greater are guaranteed to have a bigger index in the sorted array.
		Sedgewick, R. A new upper bound for Shell sort.
	www.maths.lth.se /help/R/.R/library/base/html/sort.html (349 words)

	[No title]
		This redirection is the responsibility of the shell.
		The sort command does not know where the data is coming from or where it is going to.
		The shell takes the output from the sort command and recognizes that the output is not going to standard output (screen) but is being redirected (>) to a file sorted_employee.
	www.cod.edu /people/faculty/vethka/190linux/CHAP09.doc (1355 words)

	The UNIX Forums - comb/shell sort
		no, i mean shell sort, which is apparently a kind of insertion sort.
		The shell sort is by far the fastest of the N2 class of sorting algorithms.
		The shell sort is still significantly slower than the merge, heap, and quick sorts, but its relatively simple algorithm makes it a good choice for sorting lists of less than 5000 items unless speed is hyper-critical.
	www.unix.com /showthread.php?t=8858 (1030 words)

Try your search on: Qwika (all wikis)