Python program to find the largest and smallest element in a list

This is a Python program which finds out the smallest and largest element in the list.Here we use 2 functions min() and max() to check for the smallest and largest element respectively.

PROGRAM :

lst = []
num = int(input('How many numbers: '))

for n in range(num):
    numbers = int(input('Enter number '))
    lst.append(numbers)

print("Maximum element in the list is :", max(lst), "\nMinumim element in the list is :", min(lst))

OUTPUT : 

Python - Largest and Smallest element in a list

 

Similar Programs : 
C program to find the largest element in an array
C program to find the smallest element in an array
Cpp program to find the largest element in an array
Cpp program to find the smallest element in an array
Java program to find the largest  element in an array
Java program to find the smallest element in an array

Cpp Program to find the smallest element in an array

This is a Cpp Program which finds the smallest element in an array.

Here initially first element in array and  its next element are compared array[0] and array[1] , if array[0] is lesser then the value is stored in array[0] and now the second element is increased 2 .3 4 .. until the last element is reached.

PROGRAM :

#include <iostream>

using namespace std;

int main()
{
    int n, array[100],i,sum=0;

    cout << "Enter how many numbers ? :\t" ;
    cin >> n;
    cout << endl;

    for(i=0;i<n;i++)
    {
        cout << "Enter number " << i+1 << " : \t";
        cin >> array[i];
    }

    for(i=0;i<n;i++)
    {
        if(array[0] > array[i])
            array[0] = array[i];
    }

    cout << "The largest among the numbers is : \t" << array[0] << endl;

    return 0;
}

OUTPUT : 

Cpp - Smallest Element in an array

Java Program to find the Smallest Element in Array

This is a Java Program which finds the smallest element in an array.

Here initially first element in array and  its next element are compared array[0] and array[1] , if array[1] is lesser, then the value is stored in array[0] and now the second element is increased 2 .3 4 .. until the last element is reached.

PROGRAM :

package codingcorner.in;

import java.util.Scanner;

public class SmallestElementArray {
 public static void main(String[] args) {
  int i, n;
  System.out.print("How many numbers ?\t");
  Scanner scan = new Scanner(System.in);
  n = scan.nextInt();
  int array[] = new int[n];
  for (i = 0; i < n; i++) {
   System.out.print("\nEnter number " + (i + 1));
   array[i] = scan.nextInt();
  }
  scan.close();
  for (i = 0; i < n; i++) {
   if (array[0] > array[i])
    array[0] = array[i];
  }
  System.out.print("\nThe largest among the " + n + " numbers is "
    + array[0]);
 }
}

OUTPUT :

Java - Smallest element in an array

C Program to find the Smallest Element in an Array

This is a C Program which finds the smallest largest element in an array.

Here initially first element in array and  its next element are compared array[0] and array[1] , if array[0] is greater, then the value is stored in array[0] and now the second element is increased 2 .3 4 .. until the last element is reached.

PROGRAM :

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int i,n;
    printf("How many numbers ?\t");
    scanf("%d",&n);
    int array[n];
    for(i=0;i<n;i++)
    {
        printf("\nEnter number %d: \t",i+1);
        scanf("%d",&array[i]);
    }
    for(i=0;i<n;i++)
    {
        if(array[0]>array[i])
            array[0]=array[i];
    }
    printf("The smallest among the %d numbers is %d",n,array[0]);
    return 0;
}

OUTPUT :

C - Smallest Element in an Array

Related Programs :

Descending Order( Java )

Sum Of Elements in an Array( C )

Smallest Element in an Array( C )
Largest Element in  an Array( C )
Smallest Element in an Array( C )
Ascending Order( C )
Descending Order( C )

Sum Of Elements in an Array( Java )

Largest Elements in an Array( Java )
Smallest Element in an Array( Java )
Ascending Order( Java )
Even and Odd numbers in an Array( Java )