Algorithms

Question 1

Bubble sort

Answer 1

A simple comparison-based algorithm where each pair of adjacent elements is compared and swapped if they are in the wrong order. Repeated until the array is sorted

Question 2

Merge sort

Answer 2

A divide-and-conquer algorithm that divides the array into halves, recursively sorts each half, and then merge the sorted halves

Question 3

Quick sort

Answer 3

Dive and conquer algorithm that selects a pivot, partitions the array around the pivot, and recursively sorts the partitions

Question 4

Linear search

Answer 4

Sequentially checks each element of the list until the target value is found or the list ends

Question 5

Binary search

Answer 5

Efficiently searches a sorted array by repeatedly dividing the search interval in half