Hi!

Can anyone please explain the procedure for these algorithms? I don't need the code, I only need the demonstration, how these algorithms work.

Example: 2,11,1,50,23,45

Thanks.

Printable View

- 08-19-2003GaPeShell, Heap and Quick Sort
Hi!

Can anyone please explain the procedure for these algorithms? I don't need the code, I only need the demonstration, how these algorithms work.

Example: 2,11,1,50,23,45

Thanks. - 08-19-2003WaltPRe: Shell, Heap and Quick SortQuote:

*Originally posted by GaPe*

**Hi!**

Can anyone please explain the procedure for these algorithms? I don't need the code, I only need the demonstration, how these algorithms work.

Example: 2,11,1,50,23,45

Thanks.

http://cs.smith.edu/~thiebaut/java/sort/

http://atschool.eduweb.co.uk/mbaker/sorts.html

http://math.baruch.cuny.edu/~bshaw/index-8.html

http://linux.wku.edu/~lamonml/algor/sort/

http://www.dcc.uchile.cl/~rbaeza/handbook/sort_a.html

http://www.cs.hope.edu/~alganim/ccaa/harrison.html