Sort operations by growth shape

Place each operation into its most likely growth-shape bucket. Constant-ish Logarithmic Linear Quadratic Read users[42] from an array by index Check membership in a hash-backed set by stable key Binary search a sorted array for a customer ID Walk a balanced search tree from root to one key Scan an unsorted list until an email matches Render every row in a result list once Compare every imported row with every other imported row For each order, scan all customers to find its owner

Sign up free — one personalized lesson every day, matched to your role and goals.

Already have an account? Sign in