Computing and Information Technology Interactive Digital Educational Library


Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item:

Title: quicksort
Issue Date: 6-Aug-2006
Publisher: PlanetMath
Abstract: ... 0.4in ... [4]{ ... Algorithm ... #1 ... Input : #3 ... Output : #4 ... }{} ... [6][h]{ ... The behavior of quicksort can be analyzed by considering the computation as a binary tree. Each node of the tree corresponds to one recursive call to the quicksort procedure. Consider the initial input to the algorithm, some list
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat

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