## Tag: big-o

4628 What is a plain English explanation of "Big O" notation? 2009-01-28T11:10:32.043

1800 What does O(log n) mean exactly? 2010-02-21T20:05:38.990

803 Big O, how do you calculate/approximate it? 2008-08-06T10:18:16.067

388 What is the difference between Θ(n) and O(n)? 2009-01-22T22:58:39.193

363 Constant Amortized Time 2008-10-14T08:32:47.073

316 Are there any O(1/n) algorithms? 2009-05-25T06:15:28.030

292 Big-O for Eight Year Olds? 2008-09-20T04:59:59.413

289 List of Big-O for PHP functions 2010-03-18T23:12:32.017

269 Difference between Big-O and Little-O Notation 2009-09-01T20:22:38.997

268 Computational complexity of Fibonacci Sequence 2008-12-11T20:20:25.107

236 Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one? 2015-12-09T13:25:45.403

219 Append an object to a list in R in amortized constant time, O(1)? 2010-03-13T00:14:09.813

201 How to find the kth largest element in an unsorted array of length n in O(n)? 2008-10-30T21:06:15.760

179 Is log(n!) = Θ(n·log(n))? 2010-01-19T17:15:34.773

177 Are 2^n and n*2^n in the same time complexity? 2014-02-13T20:32:33.583

174 Determining complexity for recursive functions (Big O notation) 2012-11-20T06:28:37.130

171 O(nlogn) Algorithm - Find three evenly spaced ones within binary string 2009-10-13T14:15:32.060

156 Are there any worse sorting algorithms than Bogosort (a.k.a Monkey Sort)? 2010-04-09T18:24:09.537

151 How to merge two sorted arrays into a sorted array? 2011-05-11T01:13:57.760

147 What exactly does big Ө notation represent? 2012-04-29T22:56:19.830

142 Big-O summary for Java Collections Framework implementations? 2009-02-18T04:26:23.673

141 Is a Java hashmap really O(1)? 2009-06-28T16:49:25.817

139 What are the complexity guarantees of the standard containers? 2008-10-08T07:35:11.323

116 Is this technically an O(1) algorithm for "Hello World"? 2015-12-02T17:06:54.650

112 Maximum single-sell profit 2011-08-16T23:45:55.390

97 What would cause an algorithm to have O(log n) complexity? 2012-02-05T20:49:50.617

88 Can hash tables really be O(1)? 2010-05-05T07:45:32.663

87 What does "O(1) access time" mean? 2009-03-30T16:22:51.547

86 Difference between lower bound and tight bound? 2009-01-21T04:21:40.993

85 What would cause an algorithm to have O(log log n) complexity? 2013-05-09T22:13:54.863

83 Big O of JavaScript arrays 2012-07-16T23:59:38.373

80 What is pseudopolynomial time? How does it differ from polynomial time? 2013-10-29T00:38:47.927

76 Why is inserting in the middle of a linked list O(1)? 2009-05-08T16:21:24.303

74 Time complexity of Euclid's Algorithm 2010-10-20T16:59:07.193

72 Is Big O(logn) log base e? 2009-10-15T00:28:53.797

70 Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations 2011-01-26T06:54:32.420

64 multiset, map and hash map complexity 2008-10-21T17:02:33.717

58 Is list::size() really O(n)? 2008-10-23T08:08:58.163

57 What is the complexity of regular expression? 2010-12-07T15:38:56.670

56 Can an O(n) algorithm ever exceed O(n^2) in terms of computation time? 2014-03-23T17:14:54.800

54 Why is the Big-O complexity of this algorithm O(n^2)? 2015-11-22T19:02:28.403

52 Is the time complexity of the empty algorithm O(0)? 2010-07-09T00:58:17.470

47 Stack with find-min/find-max more efficient than O(n)? 2011-08-20T19:24:21.790

46 Example of O(n!)? 2010-10-17T12:37:47.707

45 Algorithm to determine if array contains n...n+m? 2008-10-07T03:19:01.933

45 O(log N) == O(1) - Why not? 2009-09-29T10:40:01.373

44 Differences between time complexity and space complexity? 2013-09-08T16:41:54.890

44 What is the Big O analysis of this algorithm? 2015-03-19T19:00:30.470

41 Could anyone explain Big O versus Big Omega vs Big Theta? 2012-12-30T22:50:13.750

39 Empirically estimating big-oh time efficiency 2012-01-12T14:08:15.237

38 Understanding Time complexity calculation for Dijkstra Algorithm 2014-10-24T12:24:19.017

38 Why are dict lookups always better than list lookups? 2017-04-28T23:32:12.570

37 Time complexity of python set operations? 2011-09-08T16:33:10.250

36 Time complexity of Hash table 2010-10-16T14:13:39.347

34 Quicksort superiority over Heap Sort 2009-12-05T19:38:31.883

34 What is the runtime complexity of a switch statement? 2010-12-14T18:34:50.470

34 Determining the complexities given codes 2011-10-25T06:51:13.410

33 what does O(N) mean 2009-12-15T18:12:29.840

33 Is there any general rule on SQL query complexity Vs performance? 2010-01-14T16:38:03.203

33 Levenshtein Distance Algorithm better than O(n*m)? 2010-10-30T06:17:29.187

33 Difference between O(n) and O(log(n)) - which is better and what exactly is O(log(n))? 2012-04-29T03:57:42.563

32 Is this algorithm linear? 2011-12-19T15:13:44.510

31 Python dictionary keys. "In" complexity 2013-07-09T03:25:11.187

30 Computing set intersection in linear time? 2011-01-09T22:11:35.843

30 A data structure supporting O(1) random access and worst-case O(1) append? 2011-01-29T01:21:51.617

30 What is O(log(n!)) and O(n!) and Stirling Approximation 2011-11-14T06:51:42.193

30 Why a programmer would prefer O(N^3) instead of O(N^2) 2014-01-11T22:53:00.207

29 What is the time complexity of indexing, inserting and removing from common data structures? 2008-09-23T18:25:01.403

29 What is the difference between O, Ω, and Θ? 2009-12-25T03:47:12.207

29 What is the complexity of this simple piece of code? 2011-08-23T04:01:01.253

29 O(n log n) vs O(n) -- practical differences in time complexity 2014-01-31T20:43:31.053

29 Why does this O(n^2) code execute faster than O(n)? 2018-11-17T22:43:47.380

28 What is Big O notation? Do you use it? 2008-09-25T12:29:50.413

28 How can std::make_heap be implemented while making at most 3N comparisons? 2011-06-09T22:03:29.063

28 Time Complexity of building a Suffix Tree 2011-09-17T01:51:29.367

28 array_unique vs array_flip 2011-11-30T05:40:34.580

27 Big O Notation Homework--Code Fragment Algorithm Analysis? 2008-10-19T18:52:21.610

27 How to calculate order (big O) for more complex algorithms (eg quicksort) 2010-04-12T23:37:12.673

27 Quick sort Worst case 2010-10-25T22:56:12.207

27 Why is constant always dropped from big O analysis? 2014-03-05T04:51:34.383

27 How come list element lookup is O(1) in Python? 2018-10-07T02:33:28.570

26 Why isn't LinkedList.Clear() O(1) 2011-03-01T22:12:03.227

26 What's the time complexity of array.splice() in Google Chrome? 2011-03-03T02:16:20.147

26 Are there any real O(n^n) algorithms? 2011-05-27T18:22:23.580

26 What are the rules for the "Ω(n log n) barrier" for sorting algorithms? 2011-08-23T01:07:23.313

26 Why is the runtime of the Selection Algorithm O(n)? 2012-01-09T02:48:12.817

26 Is bit shifting O(1) or O(n)? 2012-01-31T17:05:43.437

26 Difference between Big-Theta and Big O notation in simple language 2012-08-27T08:00:01.483

25 Asymptotic complexity of .NET collection classes 2009-05-12T09:31:25.543

25 C# List remove from end, really O(n)? 2011-03-22T18:45:06.767

25 Big O notation Log Base 2 or Log Base 10 2013-12-20T17:50:13.650

25 Which is better: O(n log n) or O(n^2) 2014-04-27T21:29:19.867

24 A range intersection algorithm better than O(n)? 2008-11-19T22:18:30.150

24 Search an element in a heap 2010-03-03T16:26:40.343