// C program to implement linear search using loops
#include <stdio.h>
 
// linear search function that searches the key in arr
int linearSearch(int* arr, int size, int key)
{
	// starting traversal
	for (int i = 0; i < size; i++) {
		// checking condition
		if (arr[i] == key) {
			return i;
		}
	}
	return -1;
}
 
// Driver code
int main()
{
	int arr[10] = { 3, 4, 1, 7, 5, 8, 11, 42, 3, 13 };
	int size = sizeof(arr) / sizeof(arr[0]);
	int key = 4;
 
	// calling linearSearch
	int index = linearSearch(arr, size, key);
 
	// printing result based on value returned by
	// linearSearch()
	if (index == -1) {
		printf("The element is not present in the arr.");
	}
	else {
		printf("The element is present at arr[%d].", index);
	}
 
	return 0;
}
 

Ly8gQyBwcm9ncmFtIHRvIGltcGxlbWVudCBsaW5lYXIgc2VhcmNoIHVzaW5nIGxvb3BzCiNpbmNsdWRlIDxzdGRpby5oPgoKLy8gbGluZWFyIHNlYXJjaCBmdW5jdGlvbiB0aGF0IHNlYXJjaGVzIHRoZSBrZXkgaW4gYXJyCmludCBsaW5lYXJTZWFyY2goaW50KiBhcnIsIGludCBzaXplLCBpbnQga2V5KQp7CgkvLyBzdGFydGluZyB0cmF2ZXJzYWwKCWZvciAoaW50IGkgPSAwOyBpIDwgc2l6ZTsgaSsrKSB7CgkJLy8gY2hlY2tpbmcgY29uZGl0aW9uCgkJaWYgKGFycltpXSA9PSBrZXkpIHsKCQkJcmV0dXJuIGk7CgkJfQoJfQoJcmV0dXJuIC0xOwp9CgovLyBEcml2ZXIgY29kZQppbnQgbWFpbigpCnsKCWludCBhcnJbMTBdID0geyAzLCA0LCAxLCA3LCA1LCA4LCAxMSwgNDIsIDMsIDEzIH07CglpbnQgc2l6ZSA9IHNpemVvZihhcnIpIC8gc2l6ZW9mKGFyclswXSk7CglpbnQga2V5ID0gNDsKCgkvLyBjYWxsaW5nIGxpbmVhclNlYXJjaAoJaW50IGluZGV4ID0gbGluZWFyU2VhcmNoKGFyciwgc2l6ZSwga2V5KTsKCgkvLyBwcmludGluZyByZXN1bHQgYmFzZWQgb24gdmFsdWUgcmV0dXJuZWQgYnkKCS8vIGxpbmVhclNlYXJjaCgpCglpZiAoaW5kZXggPT0gLTEpIHsKCQlwcmludGYoIlRoZSBlbGVtZW50IGlzIG5vdCBwcmVzZW50IGluIHRoZSBhcnIuIik7Cgl9CgllbHNlIHsKCQlwcmludGYoIlRoZSBlbGVtZW50IGlzIHByZXNlbnQgYXQgYXJyWyVkXS4iLCBpbmRleCk7Cgl9CgoJcmV0dXJuIDA7Cn0K

MQo0NTcKMQo4NwoxCjMyMAoyCjMKNAo=

1
457
1
87
1
320
2
3
4