Is this algorithm correct? is it capable of taking any sequence of values and sorting it?

Implement the following two sorting algorithms in a program called p3.py. Write two separate functions for these algorithms. Both functions must take a list of integers as the input parameter.1) Bogosort: first shuffle the list argument (i.e., randomize the positions of every element) and then check to see if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.2) Bozosort: choose two elements in the list at random, swap them, and then check if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.Write a main() function and call both sorting functions using the same list as their arguments. The list can be of any size (try a small list first). Does any of your algorithms terminate? If yes, count the number of iterations it uses to sort the list. Does it always use the same number of repetitions? If…

Consider your roll number as an array.• Write Bubble Sort Function to sort your rollnumber in Descending Order.1Also• If the array is sorted in 1st, 2nd, OR 3rd Pass,Loop should break after that pass.• In the second pass, Number of Comparisonsshould decrease by One and so on You are required to dry run your abovecode.Hint:for 1st value of i there will be 4 steps of j(Pass1)· for the second value of i there will be 3 stepsof j (Pass2)

DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, include the following to your answer: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times

The optimised bubble sort offers none of the following benefits over conventional sorts for items that have already been sorted.

explain Selection sort algorithm.

Quick sort, just show the numbers at each step. No programming.