Question 5) Why do all cases have the same runtime in selection sort?

Sorting data structures refers to the process of arranging data in a specific format, or in ascending or descending order. The sorting process can be performed on various data structures such as tables, lists or files. Sorting is important because it helps optimize the efficiency of a data structure by placing elements in a specific order that facilitates data processing.

A variety of sorting algorithms are available, each with its own advantages and disadvantages, chosen based on factors such as the size of the data set, the nature of the input, and the required time complexity. Some common sorting algorithms include bubble sort, selection sort, insertion sort, quick sort, merge sort, bulk sort, and basic sort.