Write an algorithm to find the greatest number out of the gioven four numbers?

Answer 1

In C#: int[] list = new int[] { 1 , 2, 3, 4}; int highest = int.MinValue; foreach(int i in list) { if(i > highest) { highest = i; } } Console.WriteLine(highest.ToString() + " is the highest number");

Answer 2

// Algorithm 1 public int largest(int a, int b, int c) {

int t = a;

if(t < b) {

t = b;

}

if(t < c) {

t = c;

}

return t;

}

// Algorithm 2

public int largest(int a, int b, int c) {

if(a > b && a > c) {

return a;

}

if(b > a && b > c) {

return b;

}

return c;

}

// Algorithm 3

public int largest(int a, int b, int c) {

return a > b ? a > c ? a : c : b > c ? b : c;

}

All three do the same thing, but illustrate different ways to accomplish the same ends. The first uses a temporary variable, the second one skips the temporary variable, while the third combines all the if statements into a chained ternary statement (not recommended for professional code, but included here for illustrative purposes).