Consider the problem of finding the distance between the two closest and y is computed as x - y.) numbers. (The distance between two numbers x Design a presorting-based algorithm in pseudo code for solving this problem and determine its efficiency class. Answer: // your algorithm goes here Provide the the algorithm efficiency analysis here:

python code

The following function f uses recursion: def f(n): if n <= 1 return n else return f(n-1) + f(n-2) Let n be a valid input, i.e., a natural number. Which of the following functions returns the same result but without recursion? a) def f(n): a <- 0 ъ <-1 if n = 0 return a elsif n = 1 return b else for i in 1..n C <- a + b a <- b b <- c return b

1. Solve the Eight Tiled Puzzle Problem Using Hill-climbing algorithm with the help of C++ programming language. Initial state and goal state are given below. 7 2 1 2 3 5 8 1 5 3 6 7 8 6 Initial state Goal state The heuristic function, h(n) to be used is given as: h(n)=the number of misplaced tiles Expected Outcome. a. The number of steps required to solve the puzzle. b. Print the best state after each iteration of hill-climbing. 4. 4.

Please assist me with these questions.(for the 1st part just complete the bolded area. All other areas have been completed. Then complete the 2nd part 1. Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have the digit 5. For example, if n is 100, the program should output 5, 53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Now, let's trace this algorithm for the input n = 15: For i = 2 to 14, we check if i is prime and if i contains the digit 5. The prime numbers less than 15 are 2, 3, 5, 7, 11, 13. Among these, only 5 contains the digit 5. So, the output for n = 15 is [5]. 2. I also need help with creating JavaScript code for the flowchart provided below. Note: You will have to implement several functions that...

Consider a network of streets laid out in a rectangular grid, In a northeast path from one point in the grid to another, one may walk only to the north (up) and to the east (right). Write a program that must use a recursive function to count the number of northeast paths from one point to another in a rectangular grid. Your program should prompt the user to input the numbers of points to the north and to east respectively, and then output the total number of paths. Notes: 1. Here is a file (timer.h download and timer.cpp download) which should be included in your program to measure time in Window or Unix (includes Mac OS and Linux) systems (use start() for the beginning of the algorithm, stop() for the ending, and show() for printing). 2. The computing times of this algorithm is very high, and the number of paths may be overflow, don't try input numbers even over 16. 3. Name your recursive function prototype as calcPath(int north, int east) to ease grading. 4. Paste your output

Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive.>>> sum(1) 1>>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"

Problem 7 [Algorithms integers m and k such that n = m ×ばつ 24, where m is the smallest integer. For any even integer n, it is always possible to find a pair of 1. Write an algorithm that finds a factorization of any even integer n as stated above. For instance, we have the following two factorizations: 48 = 3 ×ばつ 24 instead of 48 =わ 12 ×ばつかける 22 52 =わ 13 x 22 instead of 52 = 26 ×ばつ 2. 2. Analyze the time of your algorithm by computing the number of its multiplications. Show your work step by step. Otherwise, your solution is incorrect.

A sport footwear maker produces three different types of athletic shoes, namely: "Trainer", "Runner" and "Sneaker". Given K pairs of athletic shoes, where K is a positive integer, develop an algorithm to count and display the numbers of "Trainer", "Runner", and "Sneaker" pairs of athletic shoes respectively. The pairs of athletic shoes are processed one at time. The number K is provided as input to the algorithm. Specify the Algorithm using a flowchart. Hint: Processing a pair of athletic shoes involves reading/entering the type, i.e. "Trainer", "Runner" or "Sneaker." Note: To draw the flowchart you may use Visio, MS Words or any free flowchart solutions such as Lucidchart ( www.lucidchart.com ) or Raptor ( raptor.martincarlisle.com) can you please make flowchart.

main.py Load default template.. 1 # TODO: Write recursive print_num_pattern () function 2 == " main ": 3 if name_ num1 = int (input ()) num2 = int(input ()) print_num_pattern (num1, num2) 4 5

The binomial coefficient (n, k) is an integer equal to (n, k) = n! / [k! (n – k)!] Note that n! = n(n – 1)(n – 2) ... (1) and that 0! = 1. a) Using this form for the binomial coefficient, write a Python user-defined function binomial(n,k) that calculates the binomial coefficient for given n and k. Make sure your function returns the answer in the form of an integer (not a float) and gives the correct value of 1 for the case where k = 0. Use phyton code to answer,

USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be solved using Greedy Algorithm Strategy. Jack and Jill’s parents decide to make their children do some house chores. So they list a set of activities that can be completed in a whole day. In order to complete each activity a certain amount of time (in hours) is required. The parents randomly call each of their children several times separately to choose from the given activities. In each call the children choose an activity based on the following conditions: In each call, each of them chooses one activity Jack has to choose an activity that has not been selected yet. Jill, being very little, should choose an activity that Jack has already chosen so that she can help her older brother because she cannot do such tasks by herself. Jack does not like doing chores, so he decides he would choose the activity that requires the shortest amount of time to complete among the remaining activities....

urgent plzzz..asap