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: Analysis of Algorithms
Lecture 4
Max Alekseyev
University of South Carolina
August 31, 2010
Outline
Sorting Problem
Insertion Sort
Running Time Analysis
Divide-and-Conquer
Merge Sort
Sorting Problem
Input A sequence of n numbers a1, a2, . . . , an .
Output A permutation (reordering) a1, a2, . . . , an of the
input sequence such that a1 a2 an
Insertion Sort
Insertion sort is an efficient algorithm for sorting a small number
of elements. It works the way many people sort a hand of playing
cards:
Start with an empty left hand and the cards face down on the

  

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

 

Collections: Biotechnology; Computer Technologies and Information Sciences