Elementary Sorts

Union-Find

Stack (abstract data type)

Java

Merge sort

Priority Queues

Binary Search Tree (BST)

Geometric Applications of BSTs

Graphs

Dynamic programming

Mincuts

Trie

Algorithm Design

Minimum Spanning Tree (MST)

Analysis of Algorithms

Queue (abstract data type)

Quick Sort

Elementary Symbol Tables

Balanced Search Trees

Hash table

Digraphs

Maxflows

String Sorts

Data Compression

Shortest paths

COS 226 Algorithms and Data Structures Princeton University Spring 2023 This course surveys crucial algorithms and data structures used in modern computing, with emphasis on sorting, searching, graphs, and strings. It aims to develop implementations, understand their performance, and evaluate their effectiveness. This course surveys the most important algorithms and data structures in use on computers today. Particular emphasis is given to algorithms for sorting, searching, graphs, and strings. The course concentrates on developing implementations, understanding their performance characteristics, and estimating their potential effectiveness in applications.  COS 126 or approval by the COS placement officer. **Textbook**. *Algorithms, 4th edition* by Robert Sedgewick and Kevin Wayne. Addison-Wesley Professional, 2011, ISBN 0-321-57351-X. The assigned readings are required.

COS 226 Algorithms and Data Structures

Data Structures and Algorithms

Elementary Sorts

1 courses cover this concept

COS 226 Algorithms and Data Structures