What is the major difference between linear and binary search?

Main difference between linear search and binary search are:

In linear search, data can be in any random order and not necessarily sorted. In this, single and multidimensional arrays both can be used. Time complexity of it is O(n). It is not an efficient method to be used for a large list.

In Binary search, data should be in sorted order. In this, only a single dimensional array can be used. Time complexity is O(log2 N). It is efficient for large lists and inputs as well.