Linear search works by searching through an array from front to back. It is inefficient and one of the most basic sorting methods.
Here is an example of a linear sort algorithm:
Linear Search
Published
Linear search works by searching through an array from front to back. It is inefficient and one of the most basic sorting methods.
Here is an example of a linear sort algorithm:
Matty's Computer Science Blog 