Advice on project for finals higher technical exam.

[woeful tundra]

Link to repository: https://gitfront.io/r/mbn-code/HjpWouTddfkn/Algoritmeanalyse-og-optimering/
As it is currently a private repository, use the link above.

So I am currently starting with my final programming & math project for my higher technical exam. I am looking for some help and advice on what some good sources for learning about:
Asymptotes and Polynomial Division
Sorting and Searching Algorithms
Asymptotic Notation and Algorithm Complexity
Visualization of Algorithms

So I can:

1. explain the concepts of asymptotes and polynomial division to determine the asymptotes of a function like g(x)=(3x^2-1)/(x^2+2x).

2. And so I can prodvide and overview of sorting and searching algorithms like Binary search & Quicksort, Merge sort.

3. Explain the asymptotic notation for the algorithms.

4. Derive the complexity of binary search & Quicksort, Merge sort.

5. Then visualise to illustrate how the algorithms work on random datasets.

6. And then lastly setup cases with different data compositions where I can then discuss the pros and cons of the algorithms.

Note that I have experience with all of the topics but I obviously need low level knowledge of the topics to write a good assignment.

[cloud ruin]

do you have a more specific question?

[woeful tundra]

If you can you recommend some good sources for learning about asymptotes, polynomial division, sorting and searching algorithms, asymptotic notation, and algorithm complexity, along with tools or techniques for visualizing these algorithms on random datasets?
Like how someone else has done it before etc to get some examples for how to structure my project and how I should document it etc.
And also in general for learning the math part and how I would implement that with c or c++
Like it would be great to get some guidance on where to start

[woeful tundra]

?

[cloud ruin]

I don't have any specific resources, it's still a bit vague
I guess just google those