Algorithms: In-place algorithm to rearrange elements of an array

C++In a given array of elements like
[a1, a2, ..., an, b1, b2, ..., bn, <X>1,<X>2, ..., <X>n]

without taking a extra memory swap elements in the array so the outcome will be like
[a1, b1, … <X>1, a2, b2, … <X>2, …, an, bn, …, <X>n] Continue reading

Algorithms: Puzzle called “Falling egg”

Assume you are given 2 eggs.
You have access to a 100-floors high building
Eggs can break if dropped from the first floor or may not even break if dropped from 100th floor.
Both eggs are identical.

You need to figure out the highest floor of a 100-storey building an egg can be dropped from without breaking.
The question is how many drops you need to make. You are allowed to break 2 eggs in the process Continue reading