User flamel12

3 votes

2 answers

851 views

Amortized analysis on a dynamic table that grows its size by $\sqrt{size} $

asked May 12, 2022 at 14:27

2 votes

1 answer

111 views

Difference between Recursion Tree & Binary Tree

asked Dec 22, 2020 at 14:42

2 votes

2 answers

1k views

Decision tree for searching element in sorted-array

asked May 1, 2022 at 7:06

1 vote

1 answer

386 views

Prove every number in double precision 32-bit floating-point format can be represented in 64-bit format

asked Nov 13, 2021 at 11:43

1 vote

1 answer

162 views

Time-Complexity Verification: Code with two loops with an index halved at each iteration

asked Apr 11, 2021 at 20:56

1 vote

1 answer

410 views

Dynamic Programming: What is a subproblem space? Why do we need varying indexes to characterize a subproblem?

asked Sep 3, 2021 at 9:09

1 vote

0 answers

86 views

Priority Queues with $DecreaseKey,FindMin,Insert$ in time $O(1)$, $DeleteMin$ in $ O(\log n)$ and $IncreaseKey$ in $O(1)$, Amortized

asked Jun 13, 2022 at 12:04

1 vote

1 answer

87 views

Calculating number of inversions in array using AVL Finger Tree

asked Jun 30, 2022 at 9:48

0 votes

0 answers

43 views

Why nondeterministic decider for $ HAMPATH $ runs in polynomial time?

asked Jul 1, 2023 at 8:09

0 votes

0 answers

225 views

Linear Search Proof of Correctness (trouble with case where $ A[j] = v $ )

asked Feb 2, 2021 at 17:47

0 votes

0 answers

120 views

Design a data-structure $BankAccount$ that supports the following operations in constant time complexity

asked Mar 11, 2022 at 18:45

0 votes

1 answer

108 views

Proving existence of an optimal substructure for the DP problem "Sherlock and Cost" from HackerRank

asked Sep 6, 2021 at 8:38

-1 votes

1 answer

314 views

Proving existence of an optimal substructure for the DP problem "Equal" from HackerRank

asked Sep 5, 2021 at 19:20

Stack Exchange Network

13 Questions

Amortized analysis on a dynamic table that grows its size by $\sqrt{size} $

Difference between Recursion Tree & Binary Tree

Decision tree for searching element in sorted-array

Prove every number in double precision 32-bit floating-point format can be represented in 64-bit format

Time-Complexity Verification: Code with two loops with an index halved at each iteration

Dynamic Programming: What is a subproblem space? Why do we need varying indexes to characterize a subproblem?

Priority Queues with $DecreaseKey,FindMin,Insert$ in time $O(1)$, $DeleteMin$ in $ O(\log n)$ and $IncreaseKey$ in $O(1)$, Amortized

Calculating number of inversions in array using AVL Finger Tree

Why nondeterministic decider for $ HAMPATH $ runs in polynomial time?

Linear Search Proof of Correctness (trouble with case where $ A[j] = v $ )

Design a data-structure $BankAccount$ that supports the following operations in constant time complexity

Proving existence of an optimal substructure for the DP problem "Sherlock and Cost" from HackerRank

Proving existence of an optimal substructure for the DP problem "Equal" from HackerRank