Linear-Search

Add a Linear Search Code in any language of your choice! Take a look at the CONTRIBUTING.md before opening a pull request.

About Linear Search

Linear search is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.

Contributors

Sl. No.	Name	Institution	Country	Language Added
1	Ayan Banerjee
2	Craxy
3	Bhrigu Kansra
4	Rahul Suresh
5	Derek Rogers
6	Astha Awasthi
7	Nattaaek Wattanuyan
8	Sahil Nishal
9	Saksham Garg
10	D. Ben Knoble
11	Priyanka Rajput
12	Amartya Kalapahar	N.M.A.M. Institute Of Technology, Nitte	India	Assembly
13	Owais Ali	Lahore University of Management Sciences	Pakistan	C#
14	Vinayak	Indraprastha Institute of Information Technology, Delhi	India	Python-3
15	Daniel Del Rio	Ateneo de Manila University	Philippines	`issue#2`
16	Andrew Joshua Loria	University of Washington	United States	Java-7
17	Jirayu Saengwannakool		Thailand	Javascript,Golang
18	Ryan Michalec		United States	F#
19	Pulkit Jatav		India	Python
20	Marco Wang	University of Taipei	Taiwan	Java, C, Bash, Python-3

About

Linear Search Code

Languages

Language:Java 32.2%Language:C# 9.1%Language:C 9.1%Language:Python 7.1%Language:C++ 5.2%Language:JavaScript 5.2%Language:Haskell 3.8%Language:Shell 3.8%Language:F# 3.6%Language:Dart 2.8%Language:Batchfile 2.7%Language:Turing 1.9%Language:Go 1.7%Language:Rust 1.7%Language:Kotlin 1.6%Language:Swift 1.5%Language:Assembly 1.5%Language:Scala 1.2%Language:PHP 1.1%Language:Prolog 1.1%Language:Ruby 0.8%Language:Common Lisp 0.7%Language:Groovy 0.5%