Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Algorithms Max Alekseyev
 

Summary: 1/23
Analysis of Algorithms
Lecture 8
Max Alekseyev
University of South Carolina
September 16, 2010
2/23
Outline
Sorting and Order Statistics Problems
Heaps
Binary Heaps
Heap Property
Building Heaps
Heapsort
3/23
Sorting Problem
Sorting is fundamental in the study of algorithms, with a wide
variety of applications.
Input: A sequence of n numbers a1, a2, . . . , an .
Output: A permutation (reordering) a1, a2, . . . , an of the

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences