¿Cómo verificar si una array contiene un valor o no?

Hay muchas formas de verificar si la array contiene algún valor específico o no, una de ellas es:

Ejemplos:

Entrada: arr[] = {10, 30, 15, 17, 39, 13}, clave = 17
Salida: Verdadero

Entrada: arr[] = {3, 2, 1, 7, 10, 13}, clave = 20
Salida: Falso

Acercarse:

Uso de funciones integradas: en lenguaje C no hay una función integrada para buscar

#include <bits/stdc++.h>
using namespace std;
 
int main()
{
    vector<int> v{ 10, 25, 15, 12, 14 };
    int key = 15;
 
    // Using inbuilt function 'find'
    if (find(v.begin(), v.end(), key) != v.end())
        cout << key << " is present in the array";
    else
        cout << key << " is not present in the array";
    return 0;
}

/*package whatever // do not write package name here */
 
import java.io.*;
import java.util.Arrays;
 
class GFG {
    public static void main(String[] args)
    {
        Integer arr[] = { 10, 25, 15, 12, 14 };
        int key = 15;
 
        // Using inbuilt function 'contains'
        boolean found = Arrays.asList(arr).contains(key);
        if (found == true) {
            System.out.println(
                key + " is present in the array");
        }
        else {
            System.out.println(
                key + " is not present in the array");
        }
    }
}

if __name__ == '__main__':
    arr = [10, 25, 15, 12, 14] 
    key = 15 
    found = False
     
    if key in arr:
        found = True
         
    if found == True:
        print(key, end = " is present in the array")
    else:
        print(key, end = " is not present in the array")

// C# Code fpr above approach
using System;
 
public class GFG {
    public static void Main(string[] args)
    {
        int []arr = { 10, 25, 15, 12, 14 };
        int key = 15;
 
        // Using inbuilt function 'contains'
        bool found = Array.Exists(arr, x => x == key);
        if (found == true) {
            Console.WriteLine(key + " is present in the array");
        }
        else {
            Console.WriteLine(key + " is not present in the array");
        }
    }
}
 
// This code is contributed by AnkThon

<?php
    $arr = array(10, 25, 15, 12, 14);
    $key = 15;
     if (in_array("$key", $arr)){
        echo "$key is present in the array";
     }
     else{
        echo "$key is not present in the array";
     }
?>

<script>
      const arr = [10, 25, 15, 12, 14];
      const key = 15
      if(arr.includes(key) == true){
        console.log( key + " is present in the array");
      }
      else{
        console.log( key + " is not present in the array");
      }
</script>

15 is present in the array

Complejidad de tiempo: O(N)

Espacio Auxiliar: O(1)

Además de estas funciones incorporadas, existen otros métodos que se pueden usar como:

• búsqueda lineal
• Búsqueda binaria
• búsqueda ternaria , y
• Otros algoritmos de búsqueda