NedyalkoKikov

SumMinFirstLastAverage - Methods

May 29th, 2016
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.19 KB | None | 0 0
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  5. using System.Threading.Tasks;
  6.  
  7. namespace Array___SumMinMaxFirstLastAverage
  8. {
  9. class SumMinMaxFirstLastAverage
  10. {
  11. static void Main()
  12. {
  13. int n = int.Parse(Console.ReadLine());
  14. int[] numbers = new int[n];
  15. for (int i = 0; i < numbers.Length; i++)
  16. {
  17. numbers[i] = int.Parse(Console.ReadLine());
  18. }
  19.  
  20. Console.WriteLine(Sum(numbers));
  21. Console.WriteLine(Min(numbers));
  22. Console.WriteLine(Max(numbers));
  23. Console.WriteLine(First(numbers));
  24. Console.WriteLine(Last(numbers));
  25. Console.WriteLine(Average(numbers));
  26. }
  27. public static int Sum(int[] ArrSum)
  28. {
  29. int sum = 0;
  30. for (int i = 0; i < ArrSum.Length; i++)
  31. {
  32. sum += ArrSum[i];
  33. }
  34.  
  35. return sum;
  36. }
  37. public static int Min(int[] ArrMin)
  38. {
  39. int minNumber = ArrMin[0];
  40. for (int i = 0; i < ArrMin.Length; i++)
  41. {
  42. if(ArrMin[i] < minNumber)
  43. {
  44. minNumber = ArrMin[i];
  45. }
  46. }
  47. return minNumber;
  48. }
  49. public static int Max(int[] ArrMax)
  50. {
  51. int maxNumber = ArrMax[0];
  52. for (int i = 0; i < ArrMax.Length; i++)
  53. {
  54. if(ArrMax[i] > maxNumber)
  55. {
  56. maxNumber = ArrMax[i];
  57. }
  58. }
  59. return maxNumber;
  60. }
  61. public static int First(int[] ArrFirst)
  62. {
  63. int firstNumber = ArrFirst[0];
  64. return firstNumber;
  65. }
  66. public static int Last(int[] ArrLast)
  67. {
  68. int lastNumber = ArrLast[ArrLast.Length - 1];
  69. return lastNumber;
  70. }
  71. public static double Average(int[] ArrAverage)
  72. {
  73. int elements = Sum(ArrAverage);
  74. return (double)elements / ArrAverage.Length;
  75. }
  76.  
  77.  
  78. }
  79. }
Advertisement
Add Comment
Please, Sign In to add comment