Big(O)

Descrizione di Big(O)

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.
- All data structures and sorting algorithms include useful links to websites or videos that will help user's gain a deeper understanding of the topic. Some websites include Khan Academy and Tutorials Point.
This app is a must have for cs students in classes such as Algorithms and Data Structures or for those planning on applying to internships!