Can you please give me a theoretical answer for this question as this is java pr
ID: 3840921 • Letter: C
Question
Can you please give me a theoretical answer for this question as this is java programming question:
The question is do you actually agree with the theoretical representation of the results presented to you? How would you go about proving or disproving what you have been told about the order of algorithms in relation to reality?
a. Create an unsorted array list with 100 random items in it and then perform a linear search on the array list looking for an item that is present in the list. Count the number of comparisons required to find the item in the list.
b. Do the same problem as part a again, but this time look for an item that is not in the list.
Explanation / Answer
soln--
Theoritical answer has benn asked for this question so,
a) in this part you can say the average number of comparisions will be (1+2+3......+100)/100 = 50.5 comparisions because the number can be present anywhere in the array. so I took average of the comparisions possible.
b) In this case every time you have to do 100 comparisions to know that the number is not in the list. so (100*100)/100 = 100 comparions on average you will take in this case.