CENG 383 - Algorithms
Yrd. Doç. Dr. Nurdan SARAN
Yrd. Doç. Dr. Murat YILMAZ
Description: Asymptotic notation. Divide and conquer approach. Solving recurrences: substitution method, master method. Bounding summations. Analysis of randomized quicksort. Heaps: heapsort, priority queues. Sorting in linear time. Greedy algorithms. Elementary graph algorithms: breadth-/depth-first search, topological sort, strongly connected components.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein." Introduction to Algorithms", MIT Press and McGraw-Hill, 3. Edition, 2009.
The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne surveys the most important algorithms and data structures in use today.
Michael T. Goodrich, Roberto Tamassia, Algorithm Design and Applications, ISBN : 978-1-119-02861-1, December 2014.
Jeffrey J. McConnell. " Analysis of Algorithms: An Active Learning Approach"
E. Horowitz and S. Sahni," Fundamentals of Computer Algorithms", Computer Science Press 1978.
Jon Kleinberg, Eva Tardos. "Algorithm Design", Addison Wesley, Pearson Education, 2006.
Animations for Graph Search Algorithms: