This course, offered by the University of Tartu in Estonia, is taught by an esteemed faculty member who wishes to remain anonymous. The objective of this course is to provide students with comprehensive understanding about algorithms and data structures. After completing the course, student is expected to be fluent in the algorithm language and be able to leverage their knowledge effectively in the development of their own applications.
n this section, I will outline the course topics, which cover a range of data structures and algorithms. The course begins with linear data structures and progresses to more complex nonlinear structures such as trees and graphs. Following the data structures, the curriculum delves into a variety of algorithms including Dijkstra’s, Prim’s, Kruskal’s, Greedy, Kadane’s, and many others. The objective of this course is to equip students with the ability to efficiently implement these algorithms in any programming language, ensuring a comprehensive understanding of their application and functionality.
This repository contains implementations of various data structures and algorithms.
The LinkedList implementation includes all methods for a doubly linked list, with arguments passed via super()
.