Compare straight forward method and divide and conquer method of finding max and min element of the list Answer:- Straightforward Method: Divide and Conquer Method: Comparison:
Explain the concept of divide and conquer . Write recursive algorithm to perform binary search on list of elements Answer:- The “Divide and Conquer” paradigm is a fundamental technique in…
List the advantages and disadvantages of divide and conquer Answer:- Advantages of Divide and Conquer Algorithm Disadvantages of Divide and Conquer
7] Write an algorithm to find uniqueness of elements in an array and give the mathematical analysis of this non-recursive algorithm with all steps. Analysis of Non-recursive Algorithms: General Plan…
Apply quick sort algorithm to sort the list E,X,A,M,P,L,E in alphabetical order. Draw tree of recursive calls made Answer:- The Quick Sort algorithm works by choosing a pivot element and…
5] The factorial function n! has value 1when n<=1 and value n *(n-1)! When n is >1. Write both a recursive and iterative algorithm to compute n!. Recursive Algorithm: Iterative…
Sort the following keyword A,L,G,O,R,I,T,H,M by applying Quicksort method Answer:- Sort the right sub-subarray: The keywords are now sorted in alphabetical order using the Quick Sort method:
4] Prove the following theorem if t1(n) ϵO((g1(n)) and t2(n) ϵ O(g2(n)) then t1(n)+ t2(n) ϵ O(max{g1(n),g2(n}) To prove the theorem, we’ll use the definitions of Big O notation and…
Design an algorithm for performing quick sorting. Apply the same to solve the following set of numbers: 5 3 1 9 8 2 4 7 Answer:- Apply the Quick sort…
Design an algorithm for performing merge sort. Analyze its time efficiency; apply the same to sort the following number. 4 9 0 -1 6 8 9 2 3 12 Answer:-…
