Understand the principles of efficient algorithms for dealing with large scale data sets and be able to select appropriate algorithms for specific problems. Understand and be able to apply the main ...

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

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

While singly-linked lists have many uses, they also present some restrictions. For one thing, singly-linked lists restrict node traversal to a single direction: you can’t traverse a singly-linked list ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

The nearest neighbor problem asks where a new point fits into an existing data set. A few researchers set out to prove that there was no universal way to solve it. Instead, they found such a way. If ...