Largest Prime in a List

Write a program to find largest prime number in the given list of numbers.

Solution in	C	JAVA	PYTHON

#include<stdio.h>
int main(){
  int n, arr[50],largestPrime=-1;
  scanf("%d",&n);
  for(int i=0;i<n;i++){
    scanf("%d",&arr[i]);
  }
  for(int i=0;i<n;i++){
    int isPrime=1;
    for(int j=2;j<=arr[i]/2;j++){
      if(arr[i]%j==0){
        isPrime=0;
        break;
      }
    }
    if(isPrime && arr[i]!=1){
      if(largestPrime==-1 || largestPrime<arr[i]){
        largestPrime=arr[i];
      }
    }
  }
  if(largestPrime==-1){
    printf("No prime in list");
  }else{
    printf("%d",largestPrime);
  }
  return 0;
}

import java.util.Scanner;
public class LargestPrimeInArray{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] arr = new int[n];
    for(int i=0;i<n;i++){
      arr[i] = sc.nextInt();
    }
    int largestPrime = -1;
    for(int ele: arr){
      boolean isPrime = true;
      for(int i=2;i<=ele/2;i++){
        if(ele%i==0){
          isPrime = false;
          break;
        }
      }
      if(isPrime && ele>1 && largestPrime<ele){
        largestPrime = ele;
      }
    }
    if(largestPrime==-1){
      System.out.println("No prime in list");
    } else {
      System.out.println(largestPrime);
    }
  }
}

n = int(input())
l = list(map(int, input().split()))[:n]
largestprime = -1
for ele in l:
  isprime = True
  for i in range(2, ele//2 + 1):
    if ele%i==0:
      isprime = False
      break
  if isprime and ele>1 and largestprime<ele:
    largestprime = ele
if largestprime == -1:
  print("No prime in list")
else:
  print(largestprime)

Sample Input:
8
2 4 6 8 81 9 5 3
Sample Output:
5