Skip to content

kb1337/Sorting-Algorithms-Benchmark

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

34 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Sorting Algorithms

Selection Sort

More details

. Array Size Number of Comparison Number of Exchange Time Complexity
Best Case N N*(N-1)/2 N O(N^2)
Worst Case N N*(N-1)/2 N O(N^2)
Average Case N N*(N-1)/2 N O(N^2)

Insertion Sort

More details

. Array Size Number of Comparison Number of Exchange Time Complexity
Best Case N N-1 0 O(N)
Worst Case N N*(N+1)/2 N O(N^2)
Average Case N N*(N+1)/4 N O(N^2)

Quick Sort

More details

. Array Size Number of Comparison Number of Exchange Time Complexity
Average Case N - - O(N*logN)
Best Case N - N-1 O(N*logN)
Worst Case N - N-1 O(N^2)

About

Sorting algorithms comparisons and analysis

Topics

Resources

Stars

Watchers

Forks

Packages

No packages published