This app serves as a reference guide to space and time complexities of Big O, which includes: A list of common data structures with average and worse case scenarios. Some data structures include hash tables, binary search tree, linked list, etc. A list of popular sorting algorithms with best, average and worse case scenarios, such as radix sort, heapsort, quicksort, etc.