Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community

Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

Explore our Questions

Ask Question

more tags

Active 1 Bountied Hot Week Month

1

vote

0

answers

18

views

Warnsdorff's rule: more errors with odd sized boards

algorithms graphs algorithm-analysis heuristics python

modified 2 hours ago Tortar 113

0

votes

1

answer

91

views

Proof for time complexity of Insertion (k-proximate) Sort equals O(nk)

time-complexity algorithm-analysis sorting proof-techniques

modified yesterday CommunityBot 1

1

vote

1

answer

70

views

Can someone help me fully grasp idea and time/space complexity with this code?

time-complexity algorithm-analysis space-complexity

modified 2 days ago CommunityBot 1

-3

votes

1

answer

42

views

Time complexity analysis of shannon-feno and huffman coding technique

algorithms time-complexity algorithm-analysis huffman-coding

modified Dec 4 at 20:56 Michel 139

1

vote

1

answer

97

views

Finding loop invariant

algorithms algorithm-analysis

modified Dec 3 at 13:07 CommunityBot 1

2

votes

1

answer

543

views

Why does the insertion-sort algorithm have a quadratic instead of a quasi-linear time complexity?

algorithm-analysis runtime-analysis sorting loops

modified Dec 3 at 9:43 CommunityBot 1

8

votes

2

answers

2k

views

Time Complexity analysis for Map-Reduce model

algorithms algorithm-analysis runtime-analysis parallel-computing

modified Dec 3 at 0:03 CommunityBot 1

2

votes

1

answer

63

views

Ask for help to prove a inequality, thanks

algorithms complexity-theory time-complexity algorithm-analysis space-complexity

answered Dec 2 at 21:59 Yuval Filmus 261k

0

votes

2

answers

182

views

Proving complexity of $T(n)=2T(n/3 + 1) + n$ non-Akra-Bazzi

complexity-theory algorithm-analysis time-complexity recurrence-relation master-theorem

modified Dec 1 at 6:06 CommunityBot 1

0

votes

4

answers

74

views

Having a lot of trouble trying to reason the formal definition of Big O

algorithms algorithm-analysis big-o-notation

answered Dec 1 at 2:29 stam_a 91

1

vote

1

answer

22

views

Shamos algorithm , cannot understand the Area part

algorithms algorithm-analysis convex-hull

answered Nov 29 at 11:04 John L. 27.9k

0

votes

1

answer

99

views

$ \Omega(m)$ and $O(m)$ meaning in theorem proof about dynamic array complexity

algorithms complexity-theory algorithm-analysis time-complexity arrays

modified Nov 29 at 3:04 CommunityBot 1

-2

votes

1

answer

27

views

Need the time complexity of this conditional statement method

algorithms complexity-theory time-complexity algorithm-analysis polynomial-time

answered Nov 27 at 20:08 TickaJules 71

-3

votes

0

answers

14

views

recurrence equation 2T(n-4) + n^2 solution?

algorithms time-complexity algorithm-analysis recurrence-relation

asked Nov 27 at 1:22 Peter 1

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled