Types of Searches and Sorts

Question 1

Linear Search

Answer 1

Linear Search is checking each element of the list one by one until you find the element you are looking for

Question 2

Binary Search

Answer 2

Binary Search is an efficient algorithm that works by repeatedly dividing in half the portion of the list that could contain the item, until you’ve narrowed down the possible locations to just one.

Question 3

Bubble Sort

Answer 3

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.

Question 4

Merge Sort

Answer 4

Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.

Question 5

Insertion Sort

Answer 5

Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands.