algorithm-analysis

  1. Merge Leaf labeled trees

  2. How to solve a knapsack problem using a modified version of DP?

  3. DP tiling a 2xN tile with L shaped tiles and 2x1 tiles?
  4. How does Bellman-Ford find Negative Weight Cycles

  5. Maximum flow properties

  6. Predecessor-subgraph property

  7. a little question on the analysis of the disjoint set
  8. Validity of DFS Algorithm

  9. Does the A* algorithm visit every node?

  10. Why is the number of comparisons in a BST missing key lookup about 2 ln N?
  11. Confuse on using bucket number to replace hashing multiple times in hyperloglog explanation

  12. What would Dijkstra's shortest path algorithm complexity be with the following data structure?

  13. how to solve substitution method T(n)=T(n/2)+Θ (lgn)

  14. Greedy max k-cut approximation algorithm

  15. Function complexity

  16. Scenarios where merge sort is preferred over quick sort

  17. Worst time complexity for finding a median number for a list and array data structure

  18. How to understand the probablistic analysis of skiplist?
  19. Three questions about the analysis of heapsort by weiss in his book DS & AA?

  20. Why model cause-specific survival times as outputs of a random vector-valued function in a nonparametric Bayesian Model?

  21. Why don't we use quick sort on a linked list?

  22. Is there really a $ O(1/n) $ algorithm?

  23. Amortized time of insertion into an Array list
  24. Specific Examples with Explanation of Similarities and Differences of how Distance Functions are used Across Different Fields

  25. Run time analysis of a program with nested for loops

  26. Time complexity of searching an element in Binary Search Tree

  27. How do we derive the runtime cost of Karatsuba's algorithm?

  28. 'meet in the middle' combined with Dynamic Programming for subset sum
  29. Efficient way to choose set from including conditions on sets

  30. Proving number of comparisons in insertion and bubble sort
  31. Average case complexity of bubble sort vs insertion sort

  32. Finding potential function for dynamic array

  33. How do iterative algorithms for Levenshtein edit distance actually find the number of substitutions, deletions etc.?

  34. Why does noise reduction use noise gating?
  35. How to get O(Big-oh) notation for following Code

  36. Time Complexity analysis for Map-Reduce model
  37. Complexity of multiplying matrix

  38. What will be T(n) after second step in a Recurrence Relation

  39. Solving Recursive for T(n-1) + T(n-2) + T(n-3) + 2

  40. How to get the optimized quicksort algorithm's time complexity
  41. What should i know to solve Recurrence relations in Algorithms

  42. Approximation Algorithm for Maximum-Cut (proving a bound on the optimum)

  43. What is the time complexity of memory allocation assumed to be?

  44. Median-of-Medians algorithm, calculating the constant c

  45. Why selection sort will require $O(N)$ time
  46. Fractional Knapsack in linear time

  47. Time complexity of MSD radix sort using counting sort
  48. Can I use Θ if tightest lower and upper bound are not the same?

  49. Does space complexity analysis usually include output space?

  50. How to prove the Big-O hypothesis from the results of an experiment

  51. Computational complexity vs Computational cost

  52. Is there any standard for comparing runtimes experimentally?

  53. Measuring cost of an algorithm by its operations
  54. The constant in the merge sort recurrence

  55. Correctness of proof by induction for proving correctness of polynomial evaluation algorithm

  56. Understanding time complexity for kth minimum in CLRS

  57. Heapsort for sorted input

  58. Complexity of the algorithm to find occurences of a given number in a given array
  59. Find largest and second largest elements of the array
  60. Algorithm to find the mode in a unimodal array
  61. Complexity analysis of recurrence with multiple variables

  62. Big O: Nested For Loop With Dependence

  63. Splitting the array in the median-of-median solution for $k$th smallest element problem

  64. Exhaustive search algorithms for np-complete problems
  65. Invariant and space complexity

  66. Comb sort average complexity

  67. Proof of correctness of algorithm
  68. What is the time complexity of this binomial coefficient algorithm?

  69. The most efficient algorithm to distribute items?

  70. Which has a higher order of growth n(n+1) or 2000n^2?
  71. Karatsuba Multiplication with n/3 division of large number

  72. AVL Tree or HashTable for storing relatively big data?
  73. Should I Ignore some of the result for runtime analysis?

  74. Proving a randomized algorithm that sums array elements
  75. Is my algorithm a $O(nm \lg m)$ solution for sorting a row and columnwise sorted $2D$ array?
  76. Error in the Algorithm Design Manual?

  77. Dictionary matching problem: dictionary size estimation

  78. Complexity of Search Algorithm

  79. How to compare two approximation algorithms

  80. How to handle the time complexity for an optimization that depends on numerical values
  81. Closed-form formula for simple recursive function
  82. Need help for maximizing solution

  83. Quick sort analysis confusion
  84. Space complexity and recurrence equation of a recursive method

  85. Probabilty that quicksort partition creates an imbalanced partition
  86. Is there a sub-quadtratic way of calculating the maximum difference between a current and prior element?

  87. Is it possible, at least in theory, to "lockfree-ize" algorithms algorithmically?
  88. Can someone tell me what the recurrence equation for this code is?

  89. Proof: "If the list is then k-sorted for some smaller integer k, then the list remains h-sorted"
  90. How to handle the repeat until convergence condition in time complexity and summarize the time complexity?
  91. Swaps Used in Selection Sort
  92. Efficient computation of Kronecker product

  93. What is correct time complexity of the substring generation algo
  94. how to find upper bound and lower bound of quadratic equation

  95. Approximating maximal independent set with a minimal vertex cover approximation

  96. What is more important in an algorithm, small runtime or small memory usage?

  97. How does raft handle committing entries from previous one?

  98. Merging sorted arrays and finding Big O bounds
  99. In Amortized Analysis, can we chose how big $n$ is?
  100. Exploit additional constraints of a scheduling problem to develop a tight approximation ratio