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.