Loading...
Loading...
OPERATIONS
[1]0
ops.
SWAPS
[2]0
ops.
GETS
0
ops.
SETS
0
ops.
COMPARISONS
0
comp.
REAL TIME
0
ms
VISUAL TIME
0
sec
OPS PER MS
0
ops/ms
COMPS PER MS
0
comp/ms
[1] Sum of Swap, Get, Set and Comparison operations.
[2] Swap operations do not count as neither Get nor Set operations.
Selection Sort
Selection Sort is a simple sorting algorithm that repeatedly selects the smallest element from the unsorted list and places it at the end of the sorted list. This process is repeated until all the elements are sorted.
Selection Sort has a time complexity of O(n²) which makes it inefficient for large data sets, but it is a simple algorithm to understand and implement.
| Big O Notation | |||
|---|---|---|---|
| Time complexity | Space complexity | ||
| Worst | Average | Best | Worst |
| O(n^2) | Θ(n^2) | Ω(n^2) | O(1) |
Big O Notation defines the lower, average and upper bounds of an algorithm, where Time complexity determines the amount of operations, and Space complexity the amount of memory that can be used
