What if we used geometric mean instead of arithmetic in binary search algorithm?

What is the number of possible quadrilaterals that can be made using the elements of an array?

Is the concept of Distance 2 edge coloring equivalent to (or same as) Strong edge coloring of Graphs?

How do I convert a string containing one character into an integer?

How do I build the concepts of Data structures from the beginning?

Is there any compression algorithm for 16-bit grayscale video?

You need to write an algorithm which detects whether a number is Odd or Even using MOD?

In implementing Kruskal’s algorithm, if two edges have the same value which one should one choose?

Are ordinary bits, not qubits, inputs to quantum computers/algoritms? What about outputs?

How do I implement a Binary Search Tree in C?

Why not use Dijkstra or Bellman-Ford for finding the shortest path between two persons in Facebook and why not use bidirectional BFS in DVR or LSR?

What is the best book for an algorithm to learn Java?

What hashing algorithm does BIP38 use?

Prove that any edge in a connected graph G is a branch in some spanning tree of G?

Why should we be unconcerned the system incentivizes the brightest minds to spend their days inventing algorithms to essentially rip of CalPERS?

How can I sort strings using Radix Sort?

Given a min-heap of n nodes, how can you determine if there are k nodes less than a node x in O(k)?

Where can I learn how to solve recurrences via summation factor method?

What is Dijkstra’s algorithm?

What is compressed adjacency list representation in terms of data structures?