Algorithms, Part I | algorithm | Scoop.it

Robert Sedgewick, Kevin Wayne

Princeton University

 

Start: 12 August 2012 (6 weeks)

Workload: 6-10 hours/week

Computer Science: Theory
Computer Science: Programming & Software Engineering

 

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations.

 

Part I covers basic iterable data types, sorting, and searching algorithms. An introduction to fundamental data types, algorithms, and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Specific topics covered include: union-find algorithms; basic iterable data types (stack, queues, and bags); sorting algorithms (quicksort, mergesort, heapsort) and applications; priority queues; binary search trees; red-black trees; hash tables; and symbol-table applications.


Via Dr. Stefan Gruenwald