• We have BFS and DFS images in both Breadth First Traversal and Depth First Traversal. We should have illustrations in the respective sections.

Add quickselect algorithm. Quickselect is a selection algorithm to find the kth smallest element in an unordered list.

More than the algorithm, there are a lot of interfaces, classes which don't have any sort of documentation. How are they executed, their execution order, parameters etc.
Algorithm can be understood from the books and the white papers, but understanding someone else's library without document increases development time exponentially.
The library is excellent, but without proper documentation (c

There are chances that the links mentioned in the algorithm/DS table become dead or a code cross ([X]) may be pointing to a wrong URL.

A test for this is needed to prevent this in future PRs.