Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. Join them; it only takes a minute:

Sign up

Here's how it works:

Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore Our Questions

active 2 featured hot week month

more tags

-1

votes

answer

views

Do we always get the same set of edges after running Kruskal's algorithm on a single graph?

graphs algorithm-analysis trees minimum-spanning-tree

modified 5 hours ago Apass.Jack 727

vote

answer

views

Dijkstra Partitioning Algorithm : Special Case

algorithms algorithm-analysis sorting partitions

answered 2 days ago user3563894 71

votes

answer

views

Runtime analysis of prime-set computation

algorithm-analysis runtime-analysis

modified Aug 12 at 20:01 Community♦ 1

votes

answer

207

views

Predecessor-subgraph property

graphs algorithm-analysis

modified Aug 12 at 12:01 Community♦ 1

vote

answer

379

views

Python: A doubt on time and space complexity on string slicing

algorithm-analysis runtime-analysis space-analysis

modified Aug 12 at 8:14 Raphael♦ 55.8k

votes

answers

views

Average depth of a Binary Search Tree and AVL Tree

algorithm-analysis data-structures search-trees average-case balanced-search-trees

answered Aug 11 at 13:08 Edward Ned Harvey 131

-1

votes

answers

views

What algorithm to use to optimizing C(n, 2) operations?

algorithm-analysis optimization combinatorics

modified Aug 11 at 2:45 Edwin Harly 1

votes

answers

12k

views

Why does DFS only yield tree and back edges on undirected, connected graphs?

algorithms graphs algorithm-analysis graph-traversal

modified Aug 10 at 23:58 Smartens 21

votes

answers

views

Invariant on “Find K Closest Elements” problem

algorithms algorithm-analysis binary-search loop-invariants

modified Aug 9 at 20:01 Community♦ 1

votes

answers

350

views

Why is the number of comparisons in a BST missing key lookup about 2 ln N?

algorithms algorithm-analysis mathematical-analysis binary-search-trees

modified Aug 9 at 4:01 Community♦ 1

votes

answer

views

Confuse on using bucket number to replace hashing multiple times in hyperloglog explanation

algorithms algorithm-analysis probability-theory probabilistic-algorithms hashing

modified Aug 9 at 1:01 Community♦ 1

votes

answers

views

How to measure “sortedness”

algorithms algorithm-analysis sorting arrays

answered Aug 6 at 17:04 Michael Sneberger 1

votes

answer

229

views

Why is this n^2 growth?

algorithms algorithm-analysis python

modified Aug 5 at 5:16 Glorfindel 133

votes

answer

views

What is the output of below algorithms on a disconnected Graph?

graphs algorithm-analysis

answered Aug 2 at 16:03 D.W.♦ 94.5k

Browse More Questions

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

Do we always get the same set of edges after running Kruskal's algorithm on a single graph?

Dijkstra Partitioning Algorithm : Special Case

Runtime analysis of prime-set computation

Predecessor-subgraph property

Python: A doubt on time and space complexity on string slicing

Average depth of a Binary Search Tree and AVL Tree

What algorithm to use to optimizing C(n, 2) operations?

Why does DFS only yield tree and back edges on undirected, connected graphs?

Invariant on “Find K Closest Elements” problem

Why is the number of comparisons in a BST missing key lookup about 2 ln N?

Confuse on using bucket number to replace hashing multiple times in hyperloglog explanation

How to measure “sortedness”

Why is this n^2 growth?

What is the output of below algorithms on a disconnected Graph?

Hot Network Questions