Week 3 Discussion Forum

What is Linear Search, Brute Force Techniques, Insertion Sort?

What is Linear Search, Brute Force Techniques, Insertion Sort?

by Tonmoy Chandra Chando 192-15-2782 -
Number of replies: 1

We have learned about linear search, Brute Force techniques and different types of sorting.


Linear search, which is a sequential search, though it’s a slow process but it gives us absolute or optimized result. It has three cases, best, worst and average.


Then we came to know about Insertion Sort and the complexity of it. At last we learned the pseudocode of insertion sort. So, this was all about this week’s lesson.

72 words

In reply to Tonmoy Chandra Chando 192-15-2782

Re: What is Linear Search, Brute Force Techniques, Insertion Sort?

by Alif Pranto -
Linear search is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement.

This is an in-place comparison-based sorting algorithm. Here, a sub-list is maintained which is always sorted. For example, the lower part of an array is maintained to be sorted. An element which is to be 'insert'ed in this sorted sub-list, has to find its appropriate place and then it has to be inserted there. Hence the name, insertion sort.

153 words