How to recognize and use array and list data structures in your Java programs. Which algorithms work best with different types of array and list data structures. Why some algorithms will work ...

This final tutorial in the Data structures and algorithms series introduces searching and sorting with doubly-linked lists and circular-linked lists.

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, ...

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.

Big-O, Big-Omega, Big-Theta notations, and their meanings. Basic data structures: Heaps, and Binary Search Trees. Algorithm Design Approaches: Divide and Conquer including analysis using recurrences ...