
	Where results make sense

Topic: Shell_sort

Related Topics

Recursion

Subsistence farming

In the News (Thu 16 Feb 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Shellsort
		Shellsort is one of the oldest sorting algorithms, named after its inventor D.L. Shell (1959) [Sh].
		Shellsort can be implemented as a sorting network if the data-dependent Insertion Sort is replaced with Bubble Sort.
		Shellsort was originally published by D.L. Shell [Sh].
	www.iti.fh-flensburg.de /lang/algorithmen/sortieren/shell/shellen.htm (1011 words)

	fejj's log: shell sort (Site not responding. Last check: 2007-11-04)
		With this new table of increments, I was able to achieve an average sort time of about 0.09 seconds.
		In fact, ShellSort() in combination with the above increment table will sort an array of 2 million items in about the same amount of time as our optimised BinaryInsertionSort() took to sort 100 thousand items.
		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)

	Cal Poly CSC/CPE 103 Spring 2002 Week 5 Lab Part 1 (Site not responding. Last check: 2007-11-04)
		Insertion sort is the same as the shellsort code without the outer loop and with the value of gap set to 1 in the inner loops.
		Perform unit testing to verify correctness of your version of shellsort using Hibbard's gap increments.
		A suggestion is to prompt the user to enter a choice for one version or the other and then have your test run the one chosen (using an if statement) rather than rewriting the main method code for two different versions of the test driver.
	www.csc.calpoly.edu /~hitchner/CSC103.S2002/lab.5.1.html (3171 words)

	Shell sort
		Shellsort is a simple extension of insertion sort which gains speed by allowing exchanges of elements that are far apart.
		The idea is to rearrange the array to give it the property that every h
		[...] Not even the functional form of the running time for Shellsort is known.
	www.auto.tuwien.ac.at /~blieb/woop/shell.html (240 words)

	Shellsort Applet (Site not responding. Last check: 2007-11-04)
		This applet illustrates Shellsort with various increment sequences.
		Select an increment sequence (they are arranged roughly from best to worst).
		Once you've read this intro, scroll down to get the entire applet in view.
	www.cs.fiu.edu /~weiss/Shellsort.html (153 words)

	Shell sort - Wikipedia, the free encyclopedia
		Shell sort (or Shellsort) is one of the oldest sorting algorithms.
		It was invented in 1959 by Donald L. Shell [Sh].
		(described below), (OEIS sequence A033622) Shellsort needs O(n
	en.wikipedia.org /wiki/Shell_sort (1154 words)

	macosxhints - Sort lists in AppleScript using the Unix sort command
		These conditions would be also be true when using the "sort" command in the shell.
		I have also implemented a quicksort, a shellsort, an insertionsort, and a mergesort in AppleScript.
		They are not too hard to do if you know the sorting algorithm.
	www.macosxhints.com /article.php?story=20040513173003941 (817 words)

	Shell Step - (Site not responding. Last check: 2007-11-04)
		Step 2 went beyond the shell view and put...
		With Shell sort, we'll first move values using giant step sizes, so a small value...
		Search for books about this keyword at amazon.com or amazon.co.uk.
	step.fdsv.com /index.php?k=shell-step (980 words)

	online-judge.uva.es :: View topic - 10152 - Shell Sort Not working :(
		Posted: Sat Oct 25, 2003 2:32 am Post subject: shellsort not working
		Hi, I'm having troubles with this one, I’m using an algorithm very similar, but I’m getting W.A. I I’m thinking that there are a tricky test case.
		I don't think that their are any special cases...
	online-judge.uva.es /board/viewtopic.php?t=4013&sid=6e7a1245c233909135f080ca83a6afb9 (581 words)

	CmSc 250 Shell sort (Site not responding. Last check: 2007-11-04)
		Task 3: Implement Sedgewick sort using the sequence of increments proposed by Sedgewick:
		You will need first to implement a function that computes the elements in the sequence and stores them in an array increments[], and then organize the outer loop in the shellsort function to take the gaps from that array.
		Include code to count the number of copying operations (called not quite correctly swaps)
	www.simpson.edu /~sinapova/cmsc250/cmsc250-04/Labs250-04/Lab07-Shell.htm (298 words)

	Visual Basic VB - Shell Sort ( ShellSort ) Verfahren by Heinz Prelle [ Free Source-Code Center ] www.Visual-Basic5.de (Site not responding. Last check: 2007-11-04)
		Visual Basic VB - Shell Sort (ShellSort) Verfahren by Heinz Prelle [ Free Source-Code Center ] www.Visual-Basic5.de
		VB - Visual Basic - VB - Shell Sort (ShellSort) Verfahren
		'IN frmShellSort 'Beispiel: Visual Basic - VB - Shell Sort (ShellSort) Verfahren ' ' 1.
	vbclassic.piranho.com /OutaSpace/shellsor.htm (100 words)

Try your search on: Qwika (all wikis)