Skip to main content

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 19

Write a C program that uses non recursive function to search for a Key value in a given List of integers using linear search method.


Algorithm:
1. 1. Start

2. 2. Read the value of n

3. 3. for i=1 to n increment in steps of 1
Read the value of ith element into array

4. 4. Read the element(x) to be searched

5. 5. search<--linear(a,n,x)

6. 6. if search equal to 0 goto step 7 otherwise goto step 8

7. 7. print unsuccessful search

8. 8. print successful search

9. 9. stop

PROGRAM:

#include <stdio.h>
long linear_search(long a[100], long, long); 
void main()
{
long array[100], search, i, n, position; 
//clrscr();
printf("\n Entered N values:\n"); 
scanf("%ld", &n);
printf("\n Entered %d numbers:\n", n); 
for (i= 0; i < n; i++)
scanf("%ld", &array[i]);
printf("\n Enter number to search: \n"); 
scanf("%ld", &search);
position = linear_search(array, n, search); 
if (position == -1)
printf("%ld isn't present in the array.\n", search); 
else
printf("%ld is present at location %ld.\n", search, position+1); 
//getch();
}
long linear_search(long a[100], long n, long find)
{
long i;
for (i = 0 ;i< n ; i++ )
{
if (a[i] == find) return i;
}
return -1;
}
OUTPUT:
Entered N values:
8
Entered 8 numbers:
45 32 18 43 56 75 71 69
Enter number to search: 
75
75 is present at location 6.

Comments

Popular posts from this blog

INSERTION SORT, BUBBLE SORT, SELECTION SORT

// C program for insertion sort #include <math.h> #include <stdio.h> void insertionSort(int arr[], int n);     // A utility function to print a sorted array of size n void printArray(int arr[], int n) {     int i;     for (i = 0; i < n; i++)         printf("%d ", arr[i]);     printf("\n"); }    // Driver code int main() {     int arr[15],n,i;         printf("enter number of elements in array \n");     scanf("%d", &n);         printf("enter array values to sort\n");     for(i=0; i<n; i++)     scanf("%d", &arr[i]);         insertionSort(arr, n);     printArray(arr, n);        return 0; } /* Function to sort an array using insertion sort*/ void insertionSort(int arr[], int n) {     int i, key, j;     for (i = 1; i < n; i++) ...

Learning and Development Interview Questions and answers for Mathematics-1.

  1). What is Mean, Mode and Median? Solution Answer: The mean is the average of a  collection of numbers or terms in a sequence. To calculate the mean use a formula is sum of total terms divided  by number of terms. The mode  is the most f requent number or term in a sequence. It means the number that occurred  highest number of times  in a sequence. To find the mode arrange the numbers in ascending or descending order and verify which number repeated most number of times in a sorted sequence. The median is the middle number/term where the sequence is arranged in ascending or descending order. If the sorted sequence have odd number of terms then  divide by 2 and round up to get the position of the median number.  If the  sorted sequence  have  even  number of terms then  divide by 2  to get the position of the median number.  2 ). What is the Difference between Fractional and Rational number? Solu...