Skip to content

Files

Latest commit

 

History

History

03-selection-sort

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
images
images
 
 
README.md
README.md
 
 
selection-sort.py
selection-sort.py
 
 
selection-sort.rb
selection-sort.rb
 
 

README.md

Selection Sort

selection-sort

  • Selection sort takes O(n2) time.
  • It actually takes n*(n+1)/2 time (n2+n / 2), however since we don't care about constants, it is n2

selection-sort-time

  • Selection sort is a neat algorithm, but it's not very fast. Quicksort is a faster sorting algorithm that only takes O(n logn) time.