136 Is there a system behind the magic of algorithm analysis? 2014-04-09T12:59:52.003

78 How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect 2014-08-28T20:51:43.760

68 How can we assume that basic operations on numbers take constant time? 2012-05-03T00:06:31.453

64 (When) is hash table lookup O(1)? 2012-03-12T19:01:07.577

52 How is this sorting algorithm Θ(n³) and not Θ(n²), worst-case? 2017-01-18T03:37:42.240

48 Order of growth definition from Reynolds & Tymann 2015-12-21T08:02:13.030

46 Why is binary search faster than ternary search? 2014-09-08T13:12:32.257

36 How is algorithm complexity modeled for functional languages? 2017-04-25T03:13:28.870

35 How to come up with the runtime of algorithms? 2012-03-10T12:03:19.397

29 How asymptotically bad is naive shuffling? 2012-11-06T19:22:56.410

27 Is it a problem to be a programmer with no knowledge about computational complexity? 2015-02-13T07:33:30.883

26 How to measure "sortedness" 2013-05-06T17:38:13.740

23 How do O and Ω relate to worst and best case? 2014-03-26T11:10:34.473

22 Is Smoothed Analysis used outside academia? 2012-03-07T06:57:12.917

19 Do functions with slower growth than inverse Ackermann appear in runtime bounds? 2013-09-17T23:51:31.520

19 How to prove greedy algorithm is correct 2016-06-24T05:22:18.697

18 How long does the Collatz recursion run? 2016-03-10T17:42:31.567

17 How does the runtime of the Ukkonen's algorithm depend on the alphabet size? 2013-02-15T22:05:13.680

17 What are the characteristics of a $\Theta(n \log n)$ time complexity algorithm? 2013-02-25T21:02:00.667

17 Why is adding log probabilities faster than multiplying probabilities? 2017-06-23T17:33:14.617

16 Why use comparisons instead of runtime for comparing two algorithms? 2012-08-11T20:41:56.243

16 What is the advantage of Randomized Quicksort? 2012-12-24T20:26:07.713

16 What's harder: Shuffling a sorted deck or sorting a shuffled one? 2013-04-14T03:49:03.497

15 Recurrences and Generating Functions in Algorithms 2012-05-18T17:13:56.063

15 Brute force Delaunay triangulation algorithm complexity 2012-06-16T22:01:33.543

14 Randomized Selection 2012-04-18T08:21:27.190

14 Quicksort explained to kids 2012-04-19T20:23:14.023

13 Expected number of swaps in bubble sort 2012-07-05T08:44:10.770

13 Why don't we use quick sort on a linked list? 2017-11-30T18:55:50.420

12 Why not to take the unary representation of numbers in numeric algorithms? 2016-01-06T17:26:16.763

11 Sharp concentration for selection via random partitioning? 2012-04-18T20:22:01.597

11 Bound on space for selection algorithm? 2012-07-24T03:19:59.790

11 Time complexity of a triple-nested loop 2012-08-24T02:42:49.667

11 Heap - Give an $O(n \lg k)$ time algorithm to merge $k$ sorted lists into one sorted list 2013-06-24T06:20:18.200

11 Easy way to prove that this algorithm eventually terminates 2013-11-22T10:53:45.843

11 algorithm time analysis "input size" vs "input elements" 2014-12-06T06:20:54.490

10 The space complexity of recognising Watson-Crick palindromes 2012-04-11T15:21:09.507

10 Lower bound for finding kth smallest element using adversary arguments 2012-04-20T04:11:34.473

10 Tighter analysis of modified Borůvka's algorithm 2012-07-18T18:53:31.420

10 Comparison between Aho-Corasick algorithm and Rabin-Karp algorithm 2013-09-14T16:34:08.873

10 Complexity of a naive algorithm for finding the longest Fibonacci substring 2014-08-01T18:26:18.343

10 Difference between time complexity and computational complexity 2015-05-02T00:55:21.313

10 Is there any standard for comparing runtimes experimentally? 2017-10-30T10:46:20.427

9 Logarithmic vs double logarithmic time complexity 2012-03-22T14:23:03.533

9 Solving Recurrences via Characteristic Polynomial with Imaginary Roots 2012-03-31T10:13:58.077

9 Does Quicksort always have quadratic runtime if you choose a maximum element as pivot? 2012-08-31T04:24:50.107

9 Proof that a randomly built binary search tree has logarithmic height 2012-10-27T19:37:43.787

9 2-D peak finding complexity (MIT OCW 6.006) 2013-02-27T18:22:56.113

9 Solving recurrence relation with two recursive calls 2014-10-14T19:38:34.163

9 Is there a method for automatic runtime analysis of algorithms? 2014-12-05T01:15:30.870

9 Why does randomized Quicksort have O(n log n) worst-case runtime cost? 2015-01-06T03:15:28.427

9 Randomized Meldable Heap - Expected Height 2016-03-14T08:39:57.360

9 Algorithm Complexity Analysis on functional programming language implementations 2016-09-26T13:13:16.273

9 How to maximize $(h[j]-h[i])(j-i)$ in $O(n)$ 2018-02-06T18:38:38.207

8 Why is the complexity of negative-cycle-cancelling $O(V^2AUW)$? 2012-06-08T13:26:38.437

8 Given a fast and a slow computer, at what sizes does the fast computer running a slow algorithm beat the slow computer running a fast algorithm? 2012-09-18T04:09:39.707

8 Algorithm to find all 2-hop neighbors lists in a graph 2012-12-05T04:50:09.537

8 Finding maximum and minimum of consecutive XOR values 2012-12-28T03:12:04.687

8 Find the median of a list of lists 2013-02-04T23:55:34.930

8 Complexities of basic operations of searching and sorting algorithms 2013-04-03T13:09:39.333

8 Is the per-vertex error over a PageRank iteration monotonically decreasing? 2013-10-12T20:56:11.653

8 Why does introsort use heapsort rather than mergesort? 2014-05-06T08:58:17.717

8 Average case algorithm analysis using Kolmogorov Incompressibility Method 2014-12-23T09:29:55.293

8 Finding a maximal independent set in parallel 2015-02-19T09:59:37.233

8 What's the time complexity of this algorithm? And Why? 2015-10-02T14:50:25.823

8 Is there any efficient algorithm for primality testing for numbers that are of the form $4k+3$ using the square root function? 2015-12-10T21:40:48.943

8 $O(\frac{\log n}{\log \log n})$ algorithm for the prefix parity problem 2015-12-13T20:29:39.870

8 What is the running time of this recursive algorithm? 2016-01-18T05:33:07.583

8 Why Is KD-Tree-based Nearest Neighbor Exponential in K? 2016-02-20T20:41:46.603

8 What is the complexity of a bracketed search using mediants? 2016-04-15T19:55:24.653

8 Understanding compression/encoding in linear time 2016-08-12T15:35:34.580

7 What is the time complexity of this function? 2012-06-25T14:48:54.900

7 Worst-case sparse graphs for Hopcroft-Karp Algorithm 2012-08-07T05:31:16.787

7 Big O: Nested For Loop With Dependence 2012-09-07T23:38:26.383

7 Compute relational composition in $O(|E||V|)$ 2012-10-13T08:23:35.550

7 Questions about amortised analysis 2013-01-18T10:20:25.633

7 A procedure for Topological sort, proof for its correctness 2013-03-23T20:42:41.853

7 MST: Prim's algorithm complexity, why not $O(EV \lg V)$? 2013-08-05T05:59:33.073

7 Selection Sort runtime in terms of Big O 2013-12-18T16:43:12.773

7 How to analyze the performance of a genetic algorithm experimentally? 2014-01-07T13:02:11.520

7 Why is this function computable in $O(n^{1.5})$ time? 2014-02-14T14:31:23.487

7 What is the average-case running time of Fun-sort? 2014-05-29T00:58:07.050

7 Why is the transform in Schönhage–Strassen's multiplication algorithm cheap? 2014-07-11T02:40:23.340

7 What is the Big O of T(n)? 2014-10-24T14:06:56.683

7 Good mathematical book on algorithms 2015-07-27T14:35:50.943

7 n log n = c. What are some good approximations of this? 2015-08-01T17:28:23.607

7 Time complexity of Depth First Search 2016-07-16T03:00:56.037

7 How does the Galil's rule work on Boyer-Moore algorithm? 2016-09-17T10:28:07.213

7 Can we do better than $O(n\log n)$ building a balanced binary tree? 2016-11-05T15:12:14.763

7 Time complexity of addition 2016-12-30T14:08:08.490

7 Proof of correctness of algorithm to determine whether the elements of an array are repeated an equal number of times 2017-02-10T19:42:09.987

6 Quicksort vs. insertion sort on linked list: performance 2012-04-19T12:05:13.983

6 How to use adversary arguments for selection and insertion sort? 2012-04-23T03:40:40.260

6 Finding a worst case of heap sort 2012-04-27T21:28:44.810

6 How to go from a recurrence relation to a final complexity 2012-05-20T21:24:29.637

6 What is the proof for the lemma "For every iteration of the Gomory-Hu algorithm, there is a representant pair for each edge"? 2012-06-01T15:45:55.923

6 What is the complexity of this subset merge algorithm? 2012-08-21T15:00:26.797

6 Why does heapsort run in $\Theta(n \log n)$ instead of $\Theta(n^2 \log n)$ time? 2012-09-16T20:47:58.343

6 Recurrence relation for time complexity $T(n) = T(n-1) + n^2$ 2012-10-24T00:56:53.863