What is the differences between linear searching algorithms

What is the difference(s) between linear searching algorithms and binary searching algorithms.

This is for Java. Program used is NetBeans (I don\'t know if this matters or not)

Solution

Linear search :

Works on any arrays

Very efficient for small arrays

Can be applied to linked lists

More no of comparison\'s

Binary search :

Works only on sorted arrays

Doesn\'t work on linked lists

Less no of comparison\'s

Very efficient for larger arrays