Please enable JavaScript.
Coggle requires JavaScript to display documents.
Algorithms & DataStructures - Coggle Diagram
Algorithms & DataStructures
Arrays []
Strings
.split()
Sorting
O(N logN)
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Counting Sort
Radix Sort
Heap Sort
Quick Sort
Static
Dynamic
Searching -> is it sorted?
Yes - Divide et Impera - Binary Search
O(log N)
No. Will sorting make it faster? If still no ->
Linear Search
O(n)
No. Is it a String? Check if
Trie
might help
Hash Tables