Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,900 questions

51,831 answers

573 users

How to find the smallest (min) element in one dimensional int array in Java

1 Answer

0 votes
package javaapplication1;

public class Example {
    
    public static void main(String[] args) {
       
    	int arr[] = new int[]{2, 234, 48, 17, 98, -3, 800, 12237, 100, 28};
               
        int smallest = arr[0];
               
        for (int i = 1; i < arr.length; i++)
             if(arr[i] < smallest) smallest = arr[i];
               
        System.out.println("Smallest element : " + smallest);
    }
}
   
   
/*
run:

Smallest element : -3
    
*/

 



answered Feb 3, 2016 by avibootz
edited Feb 4, 2016 by avibootz
...