Linear Search

C++

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <climits>
#include <array>
#include <algorithm>

using namespace std;

int Linearsearch(int n, int key, vector<int> v)
{
    for (int i = 0; i < v.size(); i++)
    {
        if (v.at(i) == key)
        {
            return i;
        }
    }
    return -1;
}

int main()
{
    freopen("inputf.in", "r", stdin);
    freopen("outputf.in", "w", stdout);

    int n, key;
    cin >> n >> key;

    vector<int> v(n);

    for (int i = 0; i < v.size(); i++)
    {
        cin >> v.at(i);
    }

    for (int i = 0; i < v.size(); i++)
    {
        cout << v.at(i) << " ";
    }
    cout << "\n";

    cout << Linearsearch(n, key, v);

    return 0;
}

Java

class HelloWorld {
  public static void main(String args[]) {
    System.out.println("Hello, World");
  }
}

Python

def hello_world():
  print 'Hello, world!'