ramblings of a quack
ramblings of a quack
Sorting Arrays.sort() Array Type Algorithm Average Time Worst Time Space Stable In-Place Primitives (int[], double[], etc.) Dual-Pivot Quicksort O(n log n) O(n²) O(log n) ❌ No ✅ Yes Objects (String[], Integer[], custom classes) TimSort O(n log n) O(n log n) O(n) ✅ Yes ❌ No Data Structures Queue A Queue in Java is a FIFO […]
The cutest of all sorting algorithms (or at least tied with bubble sort). Has O(N^2) due to N^2/2 compares. Data movement is minimal. The running time does not depend on the input data, in the sense that it will always take the same amount of time to run, as it compares each index to all […]
Binary search is a classic search algorithm for sorted lists of elements. Below is a simple implementation. Of course, the STL provides std::binary_search() Time complexity of Binary Search: log2N Some important things to remember for the implementation: make sure to base your mid calculation with the lower bound, as below. This is because indexing is […]