Skip to main content

LINEAR SEARCH

/**
    Program Name: LINEAR SEARCH

    Description: This program finds a given Item in an Array

    Author:  Tauqirul Haque
       
*/
       
#define SIZE 5

void linearSearch(int data[], int item);
void displayElement(int data[]);

void main()
{
    int data[SIZE] = { 56,34,75,24,76};
    int item;
    int choice;
   
    while(choice != 3)
    {
        printf("\n\t\t 1. Search an Item ");
        printf("\n\t\t 2. Display The Elements ");
        printf("\n\t\t 3. Quit the Program");
        printf("\n\n\t\t Enter Your Choice #  ");
       
        scanf("%d",&choice);
       
        switch(choice)
        {
            case 1:
                        printf("Enter the Element you want to Search #  ");
                        scanf("%d",&item);
   
                           linearSearch(data,item);
                           break;
             case 2:
                         displayElement(data);
                         break;
            case 3:
                        printf("Program Terminated ... \n");
                        getch();
                        exit(0);
        }
    }
}

void linearSearch(int data[SIZE], int item)
{
    int i;
   
    for(i=0;i
    {
        if(item == data[i])
        {
            printf("\nSEARCH SUCCESSFULL #  Location = %d \n\n",i+1);
            return;
        }
    }
   
    printf("\nSearch UNSUCCESSFULL ... Item Not in the List\n");
   
}

void displayElement(int data[SIZE])
{
    int i;
    for(i=0; i
    {
        printf("\n Data[%d] = %d ", i+1, data[i]);
    }
   
    printf("\n");
}

   
   
       


Comments

Popular posts from this blog

Singly Linked List

/**     Program Name: Singly Linked List     Description: This Program is for Implemeting Singly Linked List     Author:  Tauqirul Haque         */ struct Linklist {     int item;     struct Linklist *next; }; typedef struct Linklist node; void insertAtBeginning(node **); void createAppendNode(node **); void insertInMiddle(node **); void deleteNode(node **); void displayNode(node **); void countNode(node **);  void searchElement(node **); void reverse(node **); void main() {     node *head = NULL;     int choice = 0;     while(choice != 9)     {             printf("\n\t\t\t1. Add Node At The Beginning ");     printf("\n\t\t\t2. Insert Element in the Middle ");     printf("\n\t\t\t3. Append New Node "); ...

SWAP Two Values without using temporary variable

/**     Program Name: Swap Two Numbers     Description: This Program swaps two number, using XOR     Author:  Tauqirul Haque        */ #include <stdio.h> #include <conio.h> int main() {     int firstNumber, secondNumber;        printf("Enter The First Number :  ");     scanf("%d",&firstNumber);        printf("\nEnter The Second Number :  ");     scanf("%d",&secondNumber);        printf("\n\nNumbers Before Swapping :  %d  <-> %d \n",firstNumber, secondNumber);        firstNumber = firstNumber^secondNumber;     secondNumber = firstNumber^secondNumber;     firstNumber = firstNumber^secondNumber;        printf("\nNumbers After Swapping : ...

Linux User Survey

The most popular distro is Mandriva, with 17.9% of the respondents using it, followed by Suse, with 16.2%. The most popular application is Firefox, with 47.9% of the respondents using it, followed by OpenOffice, with 31.6% and Thunderbird, with 12.0%. Also appended below is a table with the break-down of the survey participants by country. Top Distros 1 Mandriva 17.9% 2 Suse 16.2% 3 Fedora 11.1% 4 Debian 7.7% 5 Red Hat 6.8% 6 Xandros 5.1% 7 Slackware 5.1% 8 Ubuntu 3.4% 9 Centos 3.4% 10 Mepis 3.4% 11 Gentoo 3.4% 12 Knoppix 2.6% 13 Linspire 1.7% 1...