What is a Linear Search:
What is a Linear Search Program for Searching an item in the list using Linear Search The Linear Search , or sequential search , is simply examining each element in a list one by one until the desired element is found. The Linear Search is not very efficient. If the item of data to be found is at the end of the list, then all previous items must be read and checked before the item that matches the search criteria is found.
Binary Search:
Binary Search A 'divide and conquer' technique to search the list How it works? First, the search item is compared with the middle element of the list. If the search item is less than the middle item of the list, we restrict the search to the upper half of the list; otherwise, we search the l ower half of the list.
Bubble Sort:
Bubble Sort The bubble sort is one of the simplest sorting algorithms, but not one of the most efficient. It puts a list into increasing order by successively comparing adjacent elements, interchanging them if they are in the wrong order. Complexity The bubble sort uses (n-1)n/2 comparisons, so it has (-) (n2) worst-case complexity in terms of the number of comparisons used.
What is this an Algorithim for?:
What is this an Algorithim for?
Slide 7:
?