gnasher729's user avatar
gnasher729's user avatar
gnasher729's user avatar
gnasher729
  • Member for 9 years, 7 months
  • Last seen this week
68 votes
Accepted

Time complexity of an algorithm: Is it important to state the base of the logarithm?

47 votes
Accepted

Given a specific computer system, is it possible to estimate the actual precise run time of a piece of Assembly code

33 votes
Accepted

Assembly writer vs compiler in VLIW architecture

28 votes

Can we generate random numbers using irrational numbers like π and e?

28 votes

Time complexity of min() and max() on a list of constant size?

27 votes

Is there a known maximum for how much a string of 0's and 1's can be compressed?

20 votes
Accepted

Inequality caused by float inaccuracy

13 votes

Is there a known polynomial time complexity problem with bad constants?

13 votes
Accepted

Can we create faster sort algorithm than O(N log N)

12 votes

Is SAT an existential question?

12 votes

Why is English not a regular language?

12 votes
Accepted

Is there an polynomial time algorithm to find that sum of square-roots is less than an integer?

12 votes
Accepted

If NP is the class of problems that cannot be solved in polynomial time, what is co-NP?

11 votes

Why is proving something is NP-complete useful, and where can I use it?

11 votes
Accepted

Why is copy speed periodic? (or seems to be)

11 votes

Why the 127 encodings of ASCII needed to be extended to 256?

10 votes
Accepted

What is instruction throughput and instruction latency?

10 votes

Why is A implies B true if A is false and B is false?

9 votes

What did Turing mean when saying that "machines cannot give rise to surprises" is due to a fallacy?

9 votes

Why doesn't playing audio stop other tasks?

9 votes

Why do we use the number of compares to measure the time complexity when compare is quite cheap?

9 votes
Accepted

Why would you introduce the goto statement into a modern language?

9 votes

"For small values of n, O(n) can be treated as if it's O(1)"

8 votes

Is Big-Theta a more accurate description of worst case run time than Big-O?

8 votes

What are the conditions necessary for a programming language to have no undefined behavior?

8 votes

How does a computer interpret real numbers?

8 votes

How does editing software (like Microsoft word or Gmail) pick the 2nd string to compare in Levenshtein distance?

8 votes

How is ‘x + ½ = 2 and x ∈ ℤ’ an open statement?

8 votes

Why is addition as fast as bit-wise operations in modern processors?

8 votes
Accepted

Time complexity of this while loop

1
2 3 4 5
60