Sorting

Sorting algorithms:

• Bubble sort
• Selection sort
• Insertion sort
• Merge sort
• Quick sort

Intervals

You are given a list of intervals $$I_1 = [a_1, b_1], \dots, I_n = [a_n, b_n].$$

(a) Check if there exists a pair of intervals such that one is contained in the other.

(b) Check if there exists a pair of intervals which intersect.

$k$-th smallest element

Given a list of integers, find the $k$-th smallest element in it.