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/26
Analysis of Algorithms
Lecture 10
Max Alekseyev
University of South Carolina
September 21, 2010
2/26
Outline
Comparison-Based Sorting
Running Time Lower Bound
Sorting in Linear Time
Counting sort
Radix sort
Bucket sort
3/26
Comparison-Based Sorting
A comparison-based sorting algorithm is one which only inspects
the data when comparing two elements.
InsertionSort, MergeSort, HeapSort, QuickSort are
comparison-based.

  

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

 

Collections: Biotechnology; Computer Technologies and Information Sciences