This week's book giveaway is in the OCAJP 8 forum. We're giving away four copies of OCA Java SE 8 Programmer I Study Guide and have Edward Finegan & Robert Liguori on-line! See this thread for details.
I had the following question during my test however I don't know how to answer.
"Describe the changes needed if sequential search is used instead of binary search. Which approach is more efficient given that the retrieved Student arrayList is NOT sorted according to their admin number?" (4 marks)
From what I know, I think sequential search is less efficient because the algorithm search the whole list one by one, unlike the binary Search, which split the arrayList into 2 before searching, but I don't know if I'm correct. Anyone can help?