Search & Filtering
Write a recursive algorithm to multiply two positive integers m and n using repeated addition. Specify the base case and the recursive case.
Write a recursive function to generate a pattern of stars, such as the following: * * * * * * * * * * * * * * * * * * * *
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is: * * * * * * * * * * * * * * * * * * * *
Problem Statement 2 The Fibonacci series 0, 1, 1, 2, 3, 5, 8, 13, 21, … Begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms. Write a recursive function that generates N series numbers. Where N is the integer inputted by the user at runtime.
Problem Statement 1 Write a recursive function power (base, exponent) that, when invoked, returns base exponent For example, power (3, 4) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship. base exponent = base . base exponent - 1 And the terminating condition occurs when exponent is equal to 1, because base 1 = base
Write a program in c++ of doubly linked list and implement create a new node, insertion in list, search element in list, delete from list, reverse, traversal.
Write a program in C++ that reads in a set of positive integers, representing test scores for a class, and outputs how many times a particular number appears in the list. You may assume that the data set has, at most, 100 numbers and that -999 marks the end of the input data. The numbers must be output in increasing order. For example, for the following data, the output is: 55 80 78 92 95 55 78 53 92 65 78 95 85 92 85 95 95
Write a program that creates three identical arrays, list1, list2, and list3 of 5000 elements. The program then sorts list1 using bubble sort, list2 using selection sort, and list3 using insertion sort and outputs the number of comparisons and item assignments made by each sorting algorithm.
Sort the following list using the selection sort algorithm. Show the list after each iteration of the outer for loop. 36, 55, 17, 35, 63, 85, 12, 48, 3, 66
Consider the following list: 2 10 17 45 49 55 68 85 92 98 110 Using the binary search, how many comparisons are required to determine whether the following items are in the list or not? Show the values of first, last, and middle and the number of comparisons after each iteration of the loop.
