Find maximum of three number in C without using conditional statement and ternary operator

by

Taking advantage of short-circuiting in boolean expressions:

int max(int a, int b, int c)
{
     int m = a;
     (m < b) && (m = b); //these are not conditional statements.
     (m < c) && (m = c); //these are just boolean expressions.
     return m;
}

Explanation:

In boolean AND operation such as x && y, y is evaluated if and only if x is true. If x is false, then y is not evaluated, because the whole expression would be false which can be deduced without even evaluating y. This is called short-circuiting when the value of a boolean expression can be deduced without evaluating all operands in it.

Apply this principle to the above code. Initially m is a. Now if (m < b) is true, then that means, b is greater than m (which is actually a), so the second subexpression (m = b) is evaluated and m is set to b. If however (m < b) is false, then second subexpression will not be evaluated and m will remain a (which is greater than b). In a similar way, second expression is evaluated (on the next line).

In short, you can read the expression (m < x) && (m = x) as follows : set m to x if and only if m is less than x i.e (m < x) is true. Hope this helps you understanding the code.

Test code: 

int main() {
        printf("%d\n", max(1,2,3));
        printf("%d\n", max(2,3,1));
        printf("%d\n", max(3,1,2));
        return 0;
}

Output:

3
3
3

Note the implementation of max gives warnings because evaluated expressions are not used:

prog.c:6: warning: value computed is not used
prog.c:7: warning: value computed is not used

To avoid these (harmless) warnings, you can implement max as:

int max(int a, int b, int c)
{
     int m = a;
     (void)((m < b) && (m = b)); //these are not conditional statements.
     (void)((m < c) && (m = c)); //these are just boolean expressions.
     return m;
}

The trick is that now we’re casting the boolean expressions to void, which causes suppression of the warnings:

More Related Contents:

  1. Sorting (Quicksort) ,Partition
  2. Recursive and non-recursive traversal of three degree tree
  3. Fast way to tokenize a string in c
  4. how to show time performance for merge sort? [closed]
  5. What is the fastest substring search algorithm?
  6. Calculating factorial of large numbers in C
  7. Point in Polygon Algorithm
  8. What common algorithms are used for C’s rand()?
  9. Matrix multiplication: Small difference in matrix size, large difference in timings
  10. Enumerate factors of a number directly in ascending order without sorting?
  11. How to find the element of an array that is repeated at least N/2 times?
  12. read line by line in the most efficient way *platform specific*
  13. Program to print permutations of given elements [closed]
  14. Finding all the unique permutations of a string without generating duplicates
  15. Print all permutation in lexicographic order
  16. Perceptron learning algorithm not converging to 0
  17. Gaussian elimination without result for acceleration
  18. Given an audio stream, find when a door slams (sound pressure level calculation?)
  19. find if 4 points on a plane form a rectangle?
  20. Fastest way to calculate a 128-bit integer modulo a 64-bit integer
  21. Linked list recursive reverse
  22. Lookups on known set of integer keys
  23. signed and unsigned arithmetic implementation on x86
  24. Reductions in parallel in logarithmic time
  25. Sorting an array in C?
  26. forwarding (drawing) line in 3d grid
  27. Algorithm to generate bit mask
  28. a working non-recursive floodfill algorithm written in C?
  29. Variable Sized Arrays vs calloc in C
  30. A possible algorithm for determining whether two strings are anagrams of one another? [closed]

Leave a Comment