Simple Explanation of Algorithmic Design and Data Structures
Searching algorithms perform the function of comparing two values and a desired value in order to find the position of the desired value. The two main algorithms that perform this task is linear search and binary search. Linear search is the most basic of searches, checking each item until the desired item is located (Rajinikanth, B 2022). When using linear search on average it will take searching half the list to find the position of the desired item. Binary search is a lot more efficient than linear search. It relies on elements of the list being sorted already, then smaller sub lists are searched. It starts with the entire list and checks the middle element, halving the list each time. Then the item is found the search stops. There is a long list of different sorting algorithms, selection sort, merge sort, bubble sort, quick sort, and shell sort, and insertion sort to name a few. in order to complete selection sort the algorithm is finding minimum to maximum elements and s