Foundations of Algorithms and Complexity [Hebrew]
Undergraduate course, Ben-Gurion University of the Negev, Department of Industrial Engineering and Management, 2022
Course overview
This introductory course in algorithms and computational complexity covers sorting algorithms, data structures for efficient search, and fundamental graph algorithms. The final part of the course is devoted to the P vs NP question - one of the most profound open problems in computer science.