1: declare n <- length of arrayData
2: for i <- 0 to n - 2
3: for j <- 0 to n - i - 2
4: if arrayData[j] > arrayData[j + 1] then
5: swap(arrayData[j], arrayData[j + 1])
6: end if
7: end for
8: end for
1: for i <- 0 to n - 2
2: minIndex <- i
3: for j <- i + 1 to n - 1
4: if arrayData[j] < arrayData[minIndex] then minIndex <- j
5: end for
6: if minIndex != i then
7: swap(arrayData[i], arrayData[minIndex])
8: end if
1: for i <- 1 to n - 1
2: key <- arrayData[i], j <- i - 1
3: while j >= 0 and arrayData[j] > key
4: arrayData[j + 1] <- arrayData[j]
5: j <- j - 1
6: end while
7: arrayData[j + 1] <- key
8: end for
1: procedure QUICKSORT(arr, low, high)
2: if low < high then
3: pIndex <- PARTITION(arr, low, high)
4: QUICKSORT(arr, low, pIndex - 1)
5: QUICKSORT(arr, pIndex + 1, high)
6: procedure PARTITION(arr, low, high)
7: pivot <- arr[high], i <- low - 1
8: for j <- low to high - 1 swap if arr[j] < pivot
1: low <- 0, high <- length of arrayData - 1
2: while low <= high
3: mid <- (low + high) / 2
4: if arrayData[mid] == target then return mid
5: else if arrayData[mid] < target then low <- mid + 1
6: else high <- mid - 1
7: end while
8: return -1 (Not Found)