Write code to do Linear Search in an Array?

Data Structure > Searching > Linear Search

Long Question

434

Answer:

 /* Program for linear search an element */
#include <stdio.h>
#include <conio.h>

void main()
{
    int array[10];
    int i, N, keynum, found = 0;
    clrscr();
    printf("Enter the value of N\n");
    scanf("%d", &N);
    printf("Enter the elements one by one\n");
    for(i = 0; i < N; i++)
        scanf("%d", &array[i]);
    printf("Input array is\n");
    for(i = 0; i < N; i++)
        printf("%d\n", array[i]);
    printf("Enter the element to be searched\n");
    scanf("%d", &keynum);
    /* Linear search begins */
    i = 0;
    while(i < N && found == 0)
    {
        if(keynum == array[i])
            found = 1;
        i++;
    }
    if(found == 1)
        printf("SUCCESSFUL SEARCH\n");
    else
        printf("Search is FAILED\n");
} /* End of main */

The code is an implementation of the linear search algorithm in C language. The purpose of the code is to search for a specific element in an array of integers entered by the user.

The code starts with the inclusion of necessary header files i.e. stdio.h and conio.h, which contain standard input/output and console input/output functions respectively.

The main() function is defined, which contains integer type array named 'array', integer variables 'i', 'N', 'keynum' and 'found'. 'N' represents the number of elements in the array entered by the user, 'keynum' represents the element to be searched and 'found' is a flag variable to indicate if the element is found in the array or not.

The clrscr() function is used to clear the screen before taking input from the user. The user is prompted to enter the value of 'N' and then prompted to enter 'N' integers one by one, which are stored in the array.

The input array is then displayed to the user. The user is then prompted to enter the element to be searched ('keynum').

The linear search algorithm is then implemented using a while loop. The loop iterates from the first element of the array until either the element is found or the end of the array is reached. If the 'keynum' is found in the array, the 'found' variable is set to 1.

Finally, the result of the search is displayed to the user. If the element is found, the message "SUCCESSFUL SEARCH" is displayed, otherwise, the message "Search is FAILED" is displayed. The program ends with the end of the main function.

Go to Question List

This Particular section is dedicated to Question & Answer only. If you want learn more about Data Structure. Then you can visit below links to get more depth on this subject.

Data Structure Syllabus

Data Structure Tutorial

Data Structure Programs

Data Structure Question Answers

Data Structure MCQ

# C Tutorials # JAVA Tutorials # HTML Tutorials # Computer Fundamental # Data Structure # DBMS Tutorials SQL # C# Language # R Language # PHP # Python # Vue JS

Join Our telegram group to ask Questions

Click below button to join our groups.

Ask Question - CSE

Programming Language - PDF

Related Program List

571. How to do Binary Search in an Array?

Answer:

A Binary Search or Half-interval search algorithm finds the position of a specified value (the input "key") within a sorted array. In each step, the algorithm compares the input key value with the key value of the middle element of the array. If the keys match, then a matching element has been found so its index, or position, is returned. Otherwise, if the sought key is less than the middle element's key, then the algorithm repeats its action on the sub- array to the left of the middle element or, if the input key is greater, on the sub-array to the right. If the remaining array to be searched is reduced to zero, then the key cannot be found in the array and a special "Not found" indication is returned.

# Tutorial: Binary Search

Question: Searching Short

572. Write C code to do Binary Search in an Array?

# Tutorial: Binary Search

Question: Searching Long

573. What is Stack?

Answer:

A stack is a last in, first out (LIFO) abstract data type and linear data structure. A stack can have any abstract data type as an element, but is characterized by two fundamental operations, called push and pop. The push operation adds a new item to the top of the stack, or initializes the stack if it is empty. If the stack is full and does not contain enough space to accept the given item, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack. A pop either reveals previously concealed items, or results in an empty stack, but if the stack is empty then it goes into underflow state (It means no items are present in stack to be removed).

# Tutorial: Stack Data Structure Introduction

Question: Stack Data Structure Short

574. Write a Program for Stack implementation through Array?

# Tutorial: Stack operations and Implementation

Question: Stack Data Structure Long

575. What is the main difference between ARRAY and STACK?

Answer:

Stack follows LIFO. Thus the item that is first entered would be the last removed. In array the items can be entered or removed in any order. Basically each member access is done using index and no strict order is to be followed here to remove a particular element .Array may be multi-dimensional or one dimensional but stack should be one-dimensional. Size of array is fixed, while stack can be grow or shrink. We can say stack is dynamic data structure.

Here are the main differences between arrays and stacks:

Array	Stack
A collection of elements of the same data type	A collection of elements of the same data type
Has a fixed size, determined at declaration	Has a dynamic size that grows and shrinks as elements are pushed and popped
Elements are stored sequentially in contiguous memory locations	Elements are stored in a LIFO (last-in, first-out) order
Elements can be accessed directly by their index	Elements can only be accessed at the top of the stack
Can be used to implement other data structures such as queues and hash tables	Typically used as a data structure itself for applications such as undo/redo functionality or recursion

In summary, arrays have a fixed size and allow for direct element access, while stacks have a dynamic size and prioritize the most recently added element for access.

# Tutorial: Stack Data Structure Introduction

Question: Stack Data Structure Short

576. How to Evaluating Arithmetic Expression?

# Tutorial: Polish Notation

Question: Stack Data Structure Long

577. Explain Tower Of Hanoi Problem?

# Tutorial: Stack operations and Implementation

Question: Stack Data Structure Long

578. What are the assumptions While dealing with the circular queue?

Answer:

1. The front will always be pointing to the first element of the queue.
2. Each time a new element is inserted into the queue, the value of rear is incremented by one i.e., Rear = (Rear + 1);
3. Each time when an existing element is deleted from the queue, the value of rear is incremented by one i.e., Front = (Front + 1);
4. The front is the initial or first location of the queue where Rear indicates the last entry location in the queue.

# Tutorial: Queue Implementation using Linked List

Question: Queue Data Structure Short

579. Write code in C for Linear Queue through Array?

# Tutorial: Queue Implementation using Array

Question: Queue Data Structure Long

580. What is a Circular Queue?

Answer:

A circular queue is one in which the insertion of a new element is done at the very first location of the queue if the last location of the queue is full. Suppose if we have a Queue of n elements then after adding the element at the last index i.e. (n-1)th , as queue is starting with 0 index, the next element will be inserted at the very first location of the queue which was not possible in the simple linear queue. That's why linear queue leads to wastage of the memory, and this flaw of linear queue is overcome by circular queue. So, in all we can say that the circular queue is a queue in which first element come right after the last element, that means a circular queue has a starting point but no end point .

A circular queue is a type of queue data structure in which the last element of the queue is connected to the first element of the queue, forming a circular chain. In other words, it is a type of queue in which the elements are stored in a circular manner and can be accessed in a circular order.

A circular queue has two pointers called the front and rear pointers. The front pointer points to the first element of the queue, while the rear pointer points to the last element of the queue. When an element is added to the queue, it is added at the rear end, and when an element is removed from the queue, it is removed from the front end.

One of the key advantages of a circular queue is that it allows efficient use of memory. Unlike a regular queue, where empty spaces cannot be reused once they have been used, a circular queue allows empty spaces to be reused when the rear pointer wraps around to the front of the queue.

Circular queues are commonly used in computer operating systems for scheduling processes and in networking for buffering data packets. They can also be used in simulations, graphics, and other applications where a queue of items needs to be processed in a circular manner.

# Tutorial: Circular Queue

Question: Queue Data Structure Short

Chapterwise Java Program
Chapterwise C Program
Chapterwise Data Structure Program