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:

- Find three elements in an array that sum to a given value Beginner
- Departure and Destination Cities in a given itinerary Beginner
- Rearrange Array Elements (A[i] = i) | In-place Approach Medium
- Count number of pairs in an array with sum = K Medium
- Adding One to a Number Represented by an Array Medium