A short description of your algorithm, where you explain the dynamic programing approach (see the sketch of the Algorithm below). More precisely, you need to indicate how you compute d[0] (this is the initialization step), and how you compute for every i ≥ 1, the value of d[i] using the values of some of the previous d[j]'s, for j

Design and implement an algorithm using recursion and backtracking to sort an array of integers into ascending order. Consider the given array as input and produce a sorted array as output. Each time you take an integer from the input array, place it at the end of the output array. If the result is unsorted, backtrack.

Devise a recursive algorithm for finding n! mod m where n and m are positive integers.

Consider a scenario in which you are presented with a data set of length K. Write a simple recursive algorithm to choose all possible pairs of elements in the set. Assess the computational complexity and explain your calculations.

Develop Pseudo-code (English-like) for:    In the Find Largest pseudo-code algorithm of Figure 2.14, listed below, if the numbers in our list were not unique and therefore the largest number could occur more than once. Modify the algorithm below to find all the occurrences of the largest number and their position in the list.

i. Using the graph below, implement the Iterative Deepening Search algorithm considering the final state is six(6) and the initial state is zero(0) using the python programming language.   N.b Kindly add comments to your code ii.. Descriibe in summary how the algorithm was implemented.

There are various sorting algorithms available to sort data of different sizes. Three of these algorithms are Bubble sort, Shell sort, and Quicksort. In Python, write a program to generate random integer numbers of multiple sizes; 10000, 30000, 40000, 50000, and 70000, and find out which of these sorting algorithms perform the fastest sorting technique. Provide data to prove and support your findings or results by plotting a graph showing the time each takes to sort data of various sizes. It should be written in a single program. Write the code in python and also show the graphical result. Also do the proper identation of the code.

I need to write an algorithm pseudocode that sorts a list of n elements in non-increasing order by finding the largest and smallest elements and exchanging those elements with the elements in the first and last positions. Then the size of the list is reduced by 2, excluding the two elements that are already in the proper positions, and the process is repeated on the remaining part of the list until the entire list is sorted. I also need to analyze the algorithm and show the results using order notation. I was trying to use arguments but I got stuck.

Any well-considered algorithm needs to be completely clear.

discrete structure