About this Course

968,585 recent views

Learner Career Outcomes

32%

started a new career after completing these courses

34%

got a tangible career benefit from this course

17%

got a pay increase or promotion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 53 hours to complete
English
Subtitles: French, Portuguese (Brazilian), Korean, Russian, English, Spanish...

Skills you will gain

Data StructureAlgorithmsJava Programming

Learner Career Outcomes

32%

started a new career after completing these courses

34%

got a tangible career benefit from this course

17%

got a pay increase or promotion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 53 hours to complete
English
Subtitles: French, Portuguese (Brazilian), Korean, Russian, English, Spanish...

Offered by

Placeholder

Princeton University

Syllabus - What you will learn from this course

Content RatingThumbs Up98%(52,952 ratings)Info
Week
1

Week 1

10 minutes to complete

Course Introduction

10 minutes to complete
1 video (Total 9 min), 2 readings
1 video
2 readings
Welcome to Algorithms, Part I1m
Lecture Slides
9 hours to complete

Union−Find

9 hours to complete
5 videos (Total 51 min), 2 readings, 2 quizzes
5 videos
Quick Find10m
Quick Union7m
Quick-Union Improvements13m
Union−Find Applications9m
2 readings
Overview1m
Lecture Slides
1 practice exercise
Interview Questions: Union–Find (ungraded)
1 hour to complete

Analysis of Algorithms

1 hour to complete
6 videos (Total 66 min), 1 reading, 1 quiz
6 videos
Observations10m
Mathematical Models12m
Order-of-Growth Classifications14m
Theory of Algorithms11m
Memory8m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Analysis of Algorithms (ungraded)
Week
2

Week 2

9 hours to complete

Stacks and Queues

9 hours to complete
6 videos (Total 61 min), 2 readings, 2 quizzes
6 videos
Resizing Arrays9m
Queues4m
Generics9m
Iterators7m
Stack and Queue Applications (optional)13m
2 readings
Overview1m
Lecture Slides
1 practice exercise
Interview Questions: Stacks and Queues (ungraded)
1 hour to complete

Elementary Sorts

1 hour to complete
6 videos (Total 63 min), 1 reading, 1 quiz
6 videos
Selection Sort6m
Insertion Sort9m
Shellsort10m
Shuffling7m
Convex Hull13m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Elementary Sorts (ungraded)
Week
3

Week 3

9 hours to complete

Mergesort

9 hours to complete
5 videos (Total 49 min), 2 readings, 2 quizzes
5 videos
Bottom-up Mergesort3m
Sorting Complexity9m
Comparators6m
Stability5m
2 readings
Overview
Lecture Slides
1 practice exercise
Interview Questions: Mergesort (ungraded)
1 hour to complete

Quicksort

1 hour to complete
4 videos (Total 50 min), 1 reading, 1 quiz
4 videos
Selection7m
Duplicate Keys11m
System Sorts11m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Quicksort (ungraded)
Week
4

Week 4

9 hours to complete

Priority Queues

9 hours to complete
4 videos (Total 74 min), 2 readings, 2 quizzes
4 videos
Binary Heaps23m
Heapsort14m
Event-Driven Simulation (optional)22m
2 readings
Overview10m
Lecture Slides
1 practice exercise
Interview Questions: Priority Queues (ungraded)
2 hours to complete

Elementary Symbol Tables

2 hours to complete
6 videos (Total 77 min), 1 reading, 1 quiz
6 videos
Elementary Implementations9m
Ordered Operations6m
Binary Search Trees19m
Ordered Operations in BSTs10m
Deletion in BSTs9m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Elementary Symbol Tables (ungraded)30m

Reviews

TOP REVIEWS FROM ALGORITHMS, PART I

View all reviews

Frequently Asked Questions

More questions? Visit the Learner Help Center.