110. Tricky Sorting: Sort 3 Numbers Without If Statements (or Only Max())

Objective: - Given three integers, sort them without using the if condition.

Approach:

• Say 3 integers are, a, b, and c.
• Find the maximum of a, b, and c using the Max() function.
• multiply all integers by -1. Again find the Minimum of -a, -b, -c using the Max() function.
• Add the Max and Min from the above steps and subtract them from (a+b+c). It will give you a middle element.

Output:

Sorted order 1 4 9

Related Problems:

- Efficient Robot Problem - Find Minimum Trips Hard
- Sort an Array - odd numbers appear first in ascending order followed by the even numbers in descending order. Medium
- Reverse a Stack using recursion - In Place (Without using extra memory) Hard
- Most frequent word Beginner
- Merge K Sorted Arrays Hard