Merge pull request #173 from tahabinaziz/Min-&-Max-No

Max & Min No.

Author: rickwest

CONTRIBUTORS.md

@@ -40,4 +40,5 @@
 - [Rabin Khatiwada](https://github.com/rabinkhatiwada)
 - [Adrian Hernandez-Lopez](https://github.com/AdrianHL)
 - [Juan Benitez](https://github.com/juanbenitez)
-- [Chaiyapat Tantiworachot](https://github.com/pixelart7)
+- [Chaiyapat Tantiworachot](https://github.com/pixelart7)
+- [Taha Bin Aziz](https://github.com/tahabinaziz)

source/snippets/csharp/index.md

@@ -25,3 +25,45 @@ private void Shuffle(string[] e)
 	}
 }
 ```
+# C#
+
+## Minimum And Maximum Number
+
+```csharp
+int[] arr1= new int[100];
+    int i, mx, mn, n;
+	
+	
+       Console.Write("\n\nFind maximum and minimum element in an array :\n");
+       Console.Write("--------------------------------------------------\n");	
+
+       Console.Write("Input the number of elements to be stored in the array :");
+	   n= Convert.ToInt32(Console.ReadLine());  
+   
+       Console.Write("Input {0} elements in the array :\n",n);
+       for(i=0;i<n;i++)
+            {
+	      Console.Write("element - {0} : ",i);
+		  arr1[i] = Convert.ToInt32(Console.ReadLine());  
+	    }
+
+
+    mx = arr1[0];
+    mn = arr1[0];
+
+    for(i=1; i<n; i++)
+    {
+        if(arr1[i]>mx)
+        {
+            mx = arr1[i];
+        }
+
+
+        if(arr1[i]<mn)
+        {
+            mn = arr1[i];
+        }
+    }
+    Console.Write("Maximum element is : {0}\n", mx);
+    Console.Write("Minimum element is : {0}\n\n", mn);
+```