Question

How to get QuickSort algorithm to run in any time between $n\log n$ and $n^2$

score 48 · Answer 1 · 2026-03-22 12:26:53

48

Views

How to get QuickSort algorithm to run in any time between $n\log n$ and $n^2$

Published on 22 Mar 2026 - 12:26

score 166 · Answer 2 · 2018-02-01 11:10:40

166

Views

Check if we can draw a straight line from

Published on 01 Feb 2018 - 11:10

score 1.8k · Answer 3 · 2026-03-23 21:22:34

1.8k

Views

Understanding the amount of FLOPS required to perform a single iteration in GCR

Published on 23 Mar 2026 - 21:22

score 87 · Answer 4 · 2026-03-12 10:42:04

87

Views

References needed for more concise texts/notes covering same topics as Introduction to Algorithms

Published on 12 Mar 2026 - 10:42

score 618 · Answer 5 · 2018-02-01 19:51:24

618

Views

Randomized select analysis of running time if we change one line of code

Published on 01 Feb 2018 - 19:51

score 46 · Answer 6 · 2026-03-22 16:41:03

46

Views

Question regarding the $\mathcal{O}$ notation used on constant functions

Published on 22 Mar 2026 - 16:41

score 171 · Answer 7 · 2026-03-21 00:21:51

171

Views

How would you prove that a dynamic programming problem is solvable by a greedy algorithm?

Published on 21 Mar 2026 - 0:21

score 437 · Answer 8 · 2026-03-25 02:57:25

437

Views

Solve an equation; big-O notation

Published on 25 Mar 2026 - 2:57

score 680 · Answer 9 · 2018-02-02 10:48:57

680

Views

Sinkhorn Knopp algorithm convergence proof

Published on 02 Feb 2018 - 10:48

score 265 · Answer 10 · 2018-02-02 12:27:33

265

Views

A variant of the Hungarian algorithm / assignment problem

Published on 02 Feb 2018 - 12:27

score 237 · Answer 11 · 2026-03-19 18:44:59

237

Views

Fast solutions for $x^2+y^2+z^2=d^2$ for large $d>1000$

Published on 19 Mar 2026 - 18:44

score 114 · Answer 12 · 2018-02-02 21:50:24

114

Views

Modifying a linear function to start flat

Published on 02 Feb 2018 - 21:50

score 138 · Answer 13 · 2018-02-02 22:59:20

138

Views

Given a number $n$, what is the minimal number of operations $+1, -1, /2, /3$ required to reach $0$?

Published on 02 Feb 2018 - 22:59

score 41 · Answer 14 · 2018-02-03 00:55:00

41

Views

Solving With Iteration

Published on 03 Feb 2018 - 0:55

score 358 · Answer 15 · 2026-03-20 01:28:29

358

Views

How to find minimal distances route for a trip of $t$ days, given distances for each stop?

Published on 20 Mar 2026 - 1:28

List Question

How to get QuickSort algorithm to run in any time between $n\log n$ and $n^2$

Check if we can draw a straight line from

Understanding the amount of FLOPS required to perform a single iteration in GCR

References needed for more concise texts/notes covering same topics as Introduction to Algorithms

Randomized select analysis of running time if we change one line of code

Question regarding the $\mathcal{O}$ notation used on constant functions

How would you prove that a dynamic programming problem is solvable by a greedy algorithm?

Solve an equation; big-O notation

Sinkhorn Knopp algorithm convergence proof

A variant of the Hungarian algorithm / assignment problem

Fast solutions for $x^2+y^2+z^2=d^2$ for large $d>1000$

Modifying a linear function to start flat

Given a number $n$, what is the minimal number of operations $+1, -1, /2, /3$ required to reach $0$?

Solving With Iteration

How to find minimal distances route for a trip of $t$ days, given distances for each stop?

Trending Questions

Popular # Hahtags

Popular Questions