GENERAL REQUIREMENTS

• This is an individual assignment.
• All the required documents can be submitted both in softcopies into your respective slot in the BLMS class site.
• Free format for presenting the answers. You can use MS Word to document your answers but conversion to PDF is needed for this purpose.
• A demonstration of the work done, and solutions are required to made in the lecture classroom.

DESCRIPTION

Implement (code) any of the searching and sorting algorithms that we have gone through or pointed out during the lectures for this course. You are required to use Python Jupyter notebook for this purpose.

There is no limit for the number of algorithms for this purpose. The more that you do, the more marks that you may be able to accumulate.

Extra credit shall be given if:

1. the searching and sorting algorithms that you have chosen are organized into methods of two separate classes, i.e one class for doing searching and another for doing sorting.
2. The algorithm is implemented using recursion like binary search and quicksort.

For each algorithm that you have implemented, provide the following:

1. Meaningful descriptions in the Jupyter notebook cells using Markdown and comment feature.
2. The source code for the implementation and the test data that you have used, i.e input and output sets.