Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Computer Science Teaching Center >
Computer Science Teaching Center >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/62

Title: Sorting Algorithms
Authors: Gosling, James
Harrison, Jason
Boritz, Jim
Keywords: Software sub_subject: Programming Techniques,sort, bubble, merge, quick, shell, radix
Issue Date: 23-Mar-2001
Publisher: University of British Columbia
Abstract: The following applets chart the progress of several common sorting algorithms while sorting an array of data using in-place algorithms. This means that the algorithms do not allocate additional storage to hold temporary results: they sort the data in place. Some of these sorts are very stupid or very slow and should not be used in code. The use of Bubblesort is deprecated. So don't use Bubblesort! Also, don't use Swapsort! It is only a demonstration of the amount of time Java takes to swap n elements.
URI: http://www.citidel.org/handle/10117/62
Other Identifiers: 128
Appears in Collections:Computer Science Teaching Center

Files in This Item:

File Description SizeFormat
CSTC.URL.985380894.description0KbUnknownView/Open
abstract.txt0KbTextView/Open
dublin_core.xml1KbXMLView/Open
metadata.txt1KbTextView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback