Question

Explain the term :

1. Selection Sorting

2. Bubble Sorting

3. Linear Search

50 points​

Answer 1

$\huge \underline \bold \red{Answer}$

Selection Sorting

A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²), where n is the number of elements. The number of swaps is O(n).

______________________

Bubble Sorting

Bubble sort is a sorting algorithm that works by repeatedly stepping through lists that need to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. This passing procedure is repeated until no swaps are required, indicating that the list is sorted.

______________________

Linear Search

A Linear Search is the most basic type of searching algorithm. A Linear Search sequentially moves through your collection (or data structure) looking for a matching value.

______________________

Answer 2

Answer:

Selection Sorting

Selection sort is a simple sorting algorithm. This sorting algorithm is an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end.

Bubble sorting

Bubble sort is a simple algorithm which compares the first element of the array to the next one. If the current element of the array is numerically greater than the next one, the elements are swapped.

Linear Search

Linear search is used to search a key element from multiple elements. Linear search is less used today because it is slower than binary search and hashing.