Brute Force: Searching and Sorting is an algorithm strategy which have two examples. They are Linear Search and Insertion Sort.

We should solve our problem with Liner Search when it is sorted and unsorted. But when is sorted or almost sorted we use Binary Search.

Insertion sort is a simple sorting algorithm that works similar to the way you sort playing cards in your hands. The array is virtually split into a sorted and an unsorted part. Values from the unsorted part are picked and placed at the correct position in the sorted part.