When a program attempts to search a data structure for a particular item, it uses an algorithm. An algorithm is a process, defined in code, for carrying out a specific task.

When choosing a data structure or algorithm, ... the Binary Search algorithm is almost always more efficient than the Linear Search algorithm–something you’ll see for yourself in Part 2.

Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform operations such as sorting, ...

It’s a very common programming task to search a singly linked list for specific data items. While the Linear Search algorithm (introduced in Part 2) is most frequently used for this type of task ...

Learn when and how to use different data structures and their algorithms in your own code. This is harder as a student, as the problem assignments you'll work through just won't impart this knowledge.

An introduction to the analysis and implementation of algorithms and data structures including linear data structures, trees, graphs, hash tables, searching algorithms, sorting algorithms, ...

CoursesDTSA 5501 Algorithms for Searching, Sorting, and IndexingDTSA 5502 Trees and Graphs: BasicsDTSA 5503 Dynamic Programming, Greedy Algorithms - Cross-listed with CSCA 5414Total: 3 credits ...