Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Find smallest and largest in unsorted array
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//Rextester.Program.Main is the entry point for your code. Don't change it. //Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5 using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; namespace Rextester { public class Program { public static void Main(string[] args) { //Your code goes here int [] arr = new int []{2,5,3,5,6,7,2,1,1,7}; int smallest = findSmallest(arr); Console.WriteLine(smallest); int largest = findLargest(arr); Console.WriteLine(largest); } public static int findSmallest(int[] a) { int smallest = a[0]; for(int i=1; i< a.Length; i++) { if(a[i]<smallest) smallest=a[i]; } return smallest; } public static int findLargest(int[] a) { int largest = a[0]; for(int i=1; i< a.Length; i++) { if(a[i]>largest) largest=a[i]; } return largest; } } }
Show compiler warnings
[
+
]
Show input
Compilation time: 0,14 sec, absolute running time: 0,09 sec, cpu time: 0,08 sec, average memory usage: 14 Mb, average nr of threads: 3
edit mode
|
history
|
discussion