Binary search complexity for 10 elements is 0(log 10) = 1 , but the comparision required are 4 my widget math formula doesn't calculate correctly Optimal Reading Plan Appointment scheduling algorithm Algorithm : Remove duplicate elements from linked list [closed] Equals pointer in ternary search tree and limitations Know repetitions in multiset by its sum Algorithm to display the results according to dynamic priority Factorial of integer mod m fast calculation [duplicate] Maximum coprime subset Algorithm suggestion: comparing sound clips Chose which tasks to do to earn the biggest amount of money possible Multiple Knapsack Variations Algorithm to Calculate “Best” Option Based on Score Time-complexity of code containing nested loops Time-compexity of an algorithm There are at most ceiling(n/2^(h+1)) nodes of height h in any n-element tree How to sort n strings with length of t in Omega(nt+nlogn)? BASH brace expansion algorithm odd one out algorithm Find triplets in an array whose sum is some integer X Google interview algorithm puzzle: expected size of the largest connected component in a random simple graph (N nodes, N edges)? Find maximum balanced subarray Searching for max value between two 2-3 Tree leafs Asymptotic Analysis for nested loop What are the advantages of checking if N is a prime number using square root of N versus N/2? Creating all strongly connected graphs with given in-degree with equal probability Modulus in a for loop for creating a rectangle Numbers generation bad value Algo to calculate sum of sub-rectangles which allows updates as well How do I calculate the distance between cyclicly shifted consecutive integers? Time complexity for modification on quicksort Using B-Tree instead of Trie Dijkstra's algorithm with minimum edge Is there way to represent static data in Haskell? Or is there any other elegant algorithm for DFS traversal in Haskell? Algorithm for ranking with a star rating (1-5) like Amazon? Finding permutations for balanced distribution of values in lists Find the node whose deletion requires 2 rotations? Best and worst case time for Algorithm S when time complexity changes in accordance to n being even/odd Tiling a Triangular Grid Proving that any n equals to 1 after looping even n = n/2 and odd n = n + 1 Cover a polygon with K rectangles minimizing the rectangles area Refined bitwise division algorithm in MIPS Optimal way to read a book having N chapters in M days algorithm for grouping elements from multi dimensional matrix Twice-3SAT NP-complete Shortest Sub-sequence Time Complexity algorithm to find the total number of ways to reach the last layer from the initial one of a directed graph Dynamic Programming: Vertex Cover of simple graphs