Question

Please Use your keyboard (Don't use handwriting) Thank you..

I need new and unique answers, please. (Use your own words, don't copy and paste)

Discussion Topic: Assume that you are given an unsorted array that contains 100 items, and you have been asked to write/propose an efficient searching algorithm. Which algorithm would you choose and why? What are the possible trad-offs of the selected algorithm if the array size is increased (e.g., 9000 items)?

Answer 1

I tried my level best to answer this. Is there any improvement required comment to the answer.

Ans:

if the array is unsorted then there is no option then to use linear search.If you want to do multiple search then you can first sort the items and then do binary search.

Choosing the linear search will have the time complexity of (O(n)).

linear search algorithm:

public static int search(int arr[], int x)

    int n = arr.length;

    for(int i = 0; i < n; i++)

        if(arr[i] == x)

            return i;

    return -1;

if the size of array is increased the time to search an element will increase.