Quickselect Explained Time And Space Complexity Ai Engineer Coding Interview

Summary

Quicksort, from first principles. A line of students, one pivot, shorter to the left and taller to the right. We see why merge sort pays ... The AVL tree, from first principles. Sorted keys turn a binary search tree into a chain, so we keep a height on every node and ... Dijkstra's algorithm, from first principles. A courier crosses a city where every street takes different minutes: given a graph with ... The binary search tree, from first principles. A librarian must find one book among a million: shelve them so every node sends a ... Binary search, from first principles. Given a sorted list of numbers and a target, return the index of the target, or minus one if it is ... Timsort, from first principles. A library shelf that is mostly in order, and why you would never re-sort it from scratch. We see why ... Cyclic sort, from first principles. Eight guests hold tickets numbered one to eight and most sit in the wrong seats: send each ticket ... The persistent segment tree, from first principles. A shop changes one price every day and keeps no history, then someone asks ... Reservoir sampling, from first principles. A conveyor belt carries prize boxes past you, you may hold exactly one, and you never ... The lazy segment tree, from first principles. A shop raises every price from day 2 to day 6 by ten and then asks for the lowest price ... Breadth first search, from first principles. A rumour spreads through nine friends: find the fewest steps from a start node to every ... Fisher Yates shuffle, from first principles. A dealer shuffles three cards by swapping each slot with a random slot, and one ordering ... External merge sort, from first principles. A clerk whose desk fits four cards must sort a huge stack: she sorts four at a Heap sort, from first principles. A knockout tournament whose champion goes to the back of the line, then the same idea as a list ...