Linear Search

In the blank trinket given, create a function named LinearSearch that takes in two inputs: a list and a target element to be searched. This function returns True and position of element, if target element is found. If the list does not contain the target element, the function returns False and a value -1 for position.

Create a program that takes a target value from the user and uses the function LinearSearch to search whether the target is present in the list or not. If the target element is present, the program prints the position of the element too.

Implementing linear search for a sorted list.

In the blank trinket given, create a function named sortedLinearSearch that takes in two inputs: a sorted list and a target element to be searched. This function returns True and position of element, if target element is found. If the list does not contain the target element, the function returns False and a value -1 for position.

Create a program that takes a target value from the user and uses the function sortedLinearSearch to search whether the target is present in the list or not. If the target element is present, the program prints the position of the element too.

Binary Search

In the blank trinket given, create a function named BinarySearch that takes in two inputs: a sorted list and a target element to be searched. All elements in the list are unique. This function returns True and position of element, if target element is found. If the list does not contain the target element, the function returns False and a value -1 for position.

Create a program that takes a target value from the user and uses the function binarySearch to search whether the target is present in the list or not. All elements in the list are unique. If the target element is present, the program prints the position of the element too.