user40545
  • Member for 6 years, 3 months
  • Last seen more than 5 years ago
3 answers
6 votes
7k views
1 bookmarks
Compute height of AVL tree as efficiently as possible
2 answers
4 votes
5k views
1 bookmarks
Maximal difference of height between two leaves in an AVL tree
1 answers
3 votes
2k views
1 bookmarks
Maximal number of rotations after deleting a node in an AVL tree
2 answers
3 votes
911 views
Why doesn't decision tree work in case find minimum
1 answers
3 votes
2k views
Minimal number of comparisons - sorting $6$ elements
1 answers
2 votes
2k views
Finding median of three sorted array (the same length)
1 answers
2 votes
1k views
1 bookmarks
Prove that every thin AVL tree may be converted to red-black tree
1 answers
2 votes
31 views
Lower bound for comparison algorithm - checking whether permutation is odd or even
1 answers
1 votes
666 views
1 bookmarks
Does Heapsort work in time o(n log n) in the best case?
1 answers
1 votes
2k views
3 bookmarks
Data structure for set of intervals - query for all intervals contains given point
1 answers
1 votes
3k views
1 bookmarks
Every AVL tree may be red black tree
1 answers
1 votes
97 views
1 bookmarks
maximum distance in between points in taxicab metrics - inserting and deleting points
2 answers
1 votes
1k views
3 bookmarks
AVL tree such that each insert causes rotation (single or double)
1 answers
1 votes
59 views
1 bookmarks
denotional semantic for while - fixed points
1 answers
1 votes
127 views
$2$-sorted array. How to sort it in minimal number of comparisons ?
1 answers
1 votes
231 views
Sorting array containing elements from $\{1,\ldots,k\}$ in place in $O(n\log k)$
1 answers
1 votes
153 views
Sorting array with two elements - in place and minimal number of comparisons, lower bound
1 answers
1 votes
149 views
Partition array - elements non-negative and negative. Minimal number of replacements of elements
0 answers
0 votes
55 views
two connected graph - find linear spanning subgrap such that subgraph is still connected
1 answers
0 votes
74 views
lower bound of checking if in array are two different elements