Algorithms and Problem solving with Python

Catalog description

Participants will delve into the fundamental principles of algorithm design, analyzing both time and space complexity to evaluate the efficiency of various algorithms. The course covers a spectrum of searching and sorting algorithms, including linear and binary search, bubble sort, quicksort, and mergesort, fostering proficiency in their implementation. Participants will also gain insights into graph algorithms, understanding how to find the shortest path using Dijkstra's and Bellman-Ford algorithms. The properties and applications of graphs and trees in computer science are explored, providing a holistic understanding of their significance. Concepts of recursion and backtracking in algorithm design are elucidated, and participants will develop essential skills in unit testing to ensure the correctness and reliability of their algorithms.