big-o
Finding a particular Set of SubSets of a PowerSet in an efficient way
I\'m trying to find an efficient way to grab a Set of Subsets of a PowerSet. For example, this works when the set size开发者_Python百科s are small:[详细]
2023-04-07 02:02 分类:问答Run-Times: Bounds vs Case
Note: Please do not tag this as homework! I am not a student and this is not an assignment. I am a software engineer dusting off my old Data Structures & Algorithms textbook and trying to remember[详细]
2023-04-06 07:15 分类:问答Big-O analysis with functions within functions
I\'m confused about how Big-O works when dealing with functions within functions (when analyzing worst case). For开发者_StackOverflow example, what if you have something like:[详细]
2023-04-06 04:38 分类:问答How is it possible to build a suffix tree in linear time?
To build a suffix tree, in the worst cas开发者_开发问答e if all the letter of the string are different the complexity would be something like[详细]
2023-04-06 00:28 分类:问答Advanced: How to optimize my complex O(n²) algorithm
I have people and places data as: Person entity has IList<DateRangePlaces> each having IList<Place> of possible places[详细]
2023-04-05 22:49 分类:问答Proving big O of statement [closed]
Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow.[详细]
2023-04-05 20:14 分类:问答How to calculate big-theta
Can some one provide me a real time example for how to calculate big theta. Is big theta some thing like average case, (min-max)/开发者_JS百科2?[详细]
2023-04-05 18:02 分类:问答Is it possible that time complexity of any algorithm decrease as the input size increase, any example
I just read in Cormen\'s algorithm book that big-O and big-omega do not follow the trichotomy property. That means for two functions, f(n) and g(n), it may be the case that neither f(n) = O(g(n)) nor[详细]
2023-04-05 09:36 分类:问答Trouble with nested for-loop running time
I have been thinking over this problem for a few days now and am hung up on calculating the number of times the second nested for-loop will run. I believe that I have the correct formula for determini[详细]
2023-04-03 20:17 分类:问答Java: This should be O(n), maybe an ArrayList problem?
I have some code that I believe to run in O(n), however when I time it, it seems to run in polynomial time.I\'m trying to process ~200,000 records, so I did it in blocks of size MAX_COUNT so I wouldn\[详细]
2023-04-03 17:12 分类:问答