87 Why is the log in the big-O of binary search not base 2? 48 How can I multiply a binary representation by ten using logic gates? 23 When are adjacency lists or matrices the better choice? 22 How to find 5 repeated values in O(n) time? 17 Are there any algorithms or data structures that need to find the median value of a set?

### Reputation (9,472)

 +10 Show that $L = \{1^n w 1^n | n > 0 \text{ and } w ∈ \{0,1\}^*\}$ is regular +10 what is halting problem? +10 Minimum spanning tree using DFS and BFS +10 How to prove that average complexity is N/2 for linear search in the unsorted array

### Questions (2)

 12 How does a nondeterministic Turing machine work? 4 Asymptotic analysis of a real-valued function involving complex numbers

### Tags (147)

 207 algorithms × 58 78 formal-languages × 33 112 runtime-analysis × 8 71 computability × 32 88 binary-search × 2 58 graphs × 21 79 turing-machines × 43 54 regular-languages × 18 79 complexity-theory × 41 48 arithmetic

### Bookmarks (32)

 21 Algorithm to test whether a language is context-free 15 Grid covering by rectangles 12 How does a nondeterministic Turing machine work? 10 Is there a dual concept to “Turing Complete” in logic? 7 Subsequence of one string but not of others