C :

#include<stdio.h>
int main()
{
  int i,n;
  int a[15];
  int low=0,high=14;
  int mid;
  for(i=0;i<15;i++)
    scanf("%d",&a[i]);
  scanf("%d",&n);
  while(low!=high){
    mid=(low+high)/2;
    if(n<a[mid])
      high=mid;
    else if(n>a[mid])
      low=mid;
    else if(n==a[mid]){
      printf("%d\n",mid);
      break;
    }
  }
  if(low==high)
    printf("NO\n");
  return 0;
}

C++ :

#include <stdio.h>
int main() {
	int dat[15];
	int i, q, l, r, mid;
	for (i = 0;i < 15;i++)
		scanf("%d", &dat[i]);
	scanf("%d", &q);
	l = 0; r = 14;
	while (l < r) {
		mid = (l + r) / 2;
		if (dat[mid] < q)
			l = mid + 1;
		else
			r = mid;
	}
	if (dat[l] == q)
		printf("%d\n", l);
	else
		puts("NO");
	return 0;
}

Pascal :

var
  i,m:longint;
  a:array[0..14] of longint;
  b:boolean;
begin
  b:=true;
  for i:=0 to 14 do read(a[i]);
  readln;
  readln(m);
  for i:=0 to 14 do
  if a[i]=m then begin writeln(i); b:=false; break; end;
  if b then writeln('NO'); 
end.

Java :

import java.util.Scanner;

public class Main{
   private static Scanner s = new Scanner(System.in) ;
   
   public static void main(String[] args) {
	   int a[] = new int[15] ;
	  for (int i = 0; i < 15; i++) {
		  a[i] = s.nextInt() ;
	  }
	  
	  int num = s.nextInt() ;
	  
	  for (int i = 0; i < a.length; i++) {
		 if(a[i]==num){
			 System.out.println(i);
		 break ;
		 }
	  }
   }
}