# (Solved Homework): Question 4: [30 points] Write a pseudo code for a simple linear search algorithm that determines whether an u…

Question 4: [30 points] Write a pseudo code for a simple linear search algorithm that determines whether an unsorted array (i.e., an array with positive element values that are in no particular order) contains a specified search key. (Note: Dot not sort the array. Input: A sequence of n numbers A =(al, ,, ,4,)and a value v. Output: An index i such that: v = A[i] or the special value NIL ifv does not appear in A.

Don't use plagiarized sources. Get Your Custom Essay on
(Solved Homework): Question 4: [30 points] Write a pseudo code for a simple linear search algorithm that determines whether an u…
Get an essay WRITTEN FOR YOU, Plagiarism free, and by an EXPERT!

#include <stdio.h>

int Linear_search(int array[], int size, int v) //linear search to find the value in array
{
int i;
for (i=0; i<size; i++) //one by one seach every index for value
if (array[i] == v) //if array matches the value to be seached
return i; //return the index of that value
}

int main()
{
int array[]={10,3,6,12,3,6}; //initilizing array
int v,index; //v=value to be seached in array and index is the index of the value to be seached
int size=sizeof(array)/sizeof(array[0]); //calculating size of array
printf(“array size: %d”,size);
printf(“nEnter value to seach in array: “);
scanf(“%d”,&v); //asking user to enter the value to be seached in array
index=Linear_search(array, size, v); //calling function linear seach and saving the output of function in index variable
if(index==-1) //checking the value of index
{
//if index is -1 then the value is not found in array
}
else //else the value is founs in array and print its index

printf(“nSearch is sucessful!!!nValue: %d found at index: %d”,v,index);
return 0;
}

output 1:

```Enter value to seach in array: 12
Search is sucessful!!!
Value: 12 found at index: 3
```

output 2:

```Enter value to seach in array: 56
Unsucessful search!!!

Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

## Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.