SELECTION SORT ALGORITHM
A. Selection Sort
It is one of the easiest and most useful sorting algorithms for
dealing with small amount of data set. Even though it
performs a lot of comparisons, but it performs the least
amount of data moving. Thus, if your data has small keys but
large data area, then selection sorting may be the quickest
[15].
B. Pseudo Code and Execution Time of Individual
Statement of Old Selection Sort
Algorithm SelectionSort (X, n)
X[0..n-1]
S.
No
Iteration Cost Times
FOR TO
FOR TO
C. Best-Case Time Complexity of Old Selection Sort.
For the best-case scenario when we have all