Linear search

Write a program to search a element linearly.

INPUT
Enter the elements:  5 2 3 4 10 40
Element to search:  3

OUTPUT
Element is present at index 1

Ele = list(map(int,input("Enter the Elements:  ").split(" ")))
S = int(input("Element to Search:  "))
for i in range(len(Ele)):
    if Ele[i] == S:
        print("Element is present at index ",i)

INPUT_1:
Enter the Elements:  5  2  3  4  10  40
Element to Search:  3

OUTPUT:
Element is present at index  2

INPUT_2:
Enter the Elements:  85  96  5  45  200  63  54  21  23
Element to Search:  200

OUTPUT:
Element is present at index  4

INPUT_3:
Enter the Elements:  56  623  20  1000  2000  3000  1011
Element to Search:  1011

OUTPUT:
Element is present at index  6

INPUT_4:
Enter the Elements:  12  25  3
Element to Search:  25

OUTPUT:
Element is present at index  1

ILLUSTRATION

Morae Q!

1. OS operating system module using path parameter.
2. Find the smallest and largest integers after sorting using bubble sort.
3. Find the integer and its number of occurrences.
4. Algorithm complexity – Big O Notation with Examples.
5. Linear search.
6. Map module using series mapping and parallel mapping.
7. Mapping and Transposing with Map Module.
8. Map Module/built-in Function.
9. Linux commands for managing files.
10. Program which takes two lists and maps two lists into a dictionary.
11. Splitting strings and substituting using regular expressions regex.
12. Basics of regular expression Regex.
13. Find the square value of the dictionary.
14. Check whether the given key is present in the dictionary.
15. Matching an expression only in specific places using regular expressions.
16. Escaping special characters using regular expressions.
17. Check the key.
18. Grouping and sub-grouping using regular expressions.
19. Generate a Dictionary that Contains Numbers in the Form (x , x*x).
20. Algorithm complexity Big-Theta, Big-Omega and Big-O Notations.