Write a python program for linear search.
What is linear searching:
Linear searching is a searching algorithm in which we search the elements linearly . we compare the element with all the elements and if elements is found in the list then break the loop and print element is present in the list.
Code:
print(“Enter the list of the number”)
mylist=list(map(int,input().split()))
num=int(input(“Enter the number for searching”))
for i in mylist:
if i==num:
print(“Value is in the list”)
break
else:
print(“Value is not in the list”)
Output:
Enter the list of the number
12 23 43 54 67 8
Enter the number for searching 12
Value is in the list
Recommended Post:

Hackerearth Problems:
 Very Cool numbers  Hacker earth solution
 Vowel Recognition  Hackerearth practice problem solution
 Birthday party  Hacker earth solution
 Most frequent  hacker earth problem solution
 program to find symetric difference of two sets
 cost of balloons  Hacker earth problem solution
 Chacha o chacha  hacker earth problem solution
 jadu and dna  hacker earth solution
 Bricks game  hacker earth problem
 AntiPalindrome strings  hacker earth solution
 connected components in the graph  hacker earth data structure
 odd one out  hacker earth problem solution
 Minimum addition  Hackerearth Practice problem
 The magical mountain  Hackerearth Practice problem
 The first overtake  Hackerearth Practice problem
Hackerrank Problems: Playing With Characters  Hackerrank practice problem solution
 Sum and Difference of Two Numbers  hackerrank practice problem solution
 Functions in C  hackerrank practice problem solution
 Pointers in C  hackerrank practice problem solution
 Conditional Statements in C  Hackerrank practice problem solution
 For Loop in C  hackerrank practice problem solution
Data structure:
 Program to find cycle in the graph
 Implementation of singly link list
 Implementation of queue by using link list
 Algorithm of quick sort
 stack by using link list
 program to find preorder post order and inorder of the binary search tree
 Minimum weight of spanning tree
 Preorder, inorder and post order traversal of the tree
Key points:
MCQs: