Attention Programmers!

Oh man! Ad-blocking software has been detected! :'(

This website is run by the community, for the community... and it needs advertisements in order to keep running. Blocking our ads means your killing our stats!
Please disable your ad-block, or become a premium member to hide all advertisements and this notice.

I kinda need some help on a theory question.. got to do with java sorting and i hope someone could maybe help me understand the different between linear searching and bucket searching. I understand how both work just not sure when to use the one and when to use the other or does one perform the task better?

ideas?

Thanks!

 

Oh man! Ad-blocking software has been detected! :'(

This website is run by the community, for the community... and it needs advertisements in order to keep running. Blocking our ads means your killing our stats!
Please disable your ad-block, or become a premium member to hide all advertisements and this notice.

Throw in binary chop and I'm your man (Oooh - Er missus).

Harry.

 

Well, searching is all about finding the required element with the minimal effort. When selecting a search algorithm you need to ask yourself several questions:

1. Is the data sorted?
2. What is the size of the sample to be searched?
3. What is the probability of the element being found?
3. Depending on the above, which algorithm has the least complexity (O(m), where 0 < m <= N where N is the least efficient algorithm).

As you are aware every algorithm has its cost, so choose carefully.