In this course, you will learn new data structures for efficiently storing and retrieving data that is structured in an ordered sequence. Such data includes an alphabetical list of names, a family tree, a calendar of events or an inventory organized by part numbers. The specific data structures covered by this course include arrays, linked lists, queues, stacks, trees, binary trees, AVL trees, B-trees and heaps. This course also shows, through algorithm complexity analysis, how these structures enable the fastest algorithms to search and sort data.
- 5 stars83.48%
- 4 stars12.83%
- 3 stars2.41%
- 2 stars0.76%
- 1 star0.50%
ORDERED DATA STRUCTURES からの人気レビュー
Good quick introduction to ordered data structures. I think this course be well served with a bit more theory explaining the big O justifications.
This is one of the best courses I have studied so far, the instructor's way is very easy to understand yet provides in-depth understanding of the material.
Good coverage. The lecturer and teaching stuff are knowledgeable and helpful. Would be better if the slides can have more details.
Well-taught course! I love the instructor's enthusiasm and great explanations. The exercises are diverse and really help you reinforce your understanding.
Accelerated Computer Science Fundamentals専門講座について