Identify the recursive functions from the given code and give reasons why these functions are recursive. void mergeSort(int a[], int p, int r) { int q; if(p < r) { q = (p + r) / 2; mergeSort(a, p, q); mergeSort(a, q+1, r); merge(a, p, q, r); void merge(int a[], int p, int q, int r) { int b[5]; int i, j, k; k = 0; i = p; j = q+ 1; while(i <= q &&j <= r) { if(a[i] < a[j]) b[k++] = a[i++]; else b[k++] = a[j++]; } while(i <= q) b[k++] = a[i++]; while(j <= r) b[k++] = a[j++]; for(i=r; i >= p; i--) a[i] = b[--k];

Identify the recursive functions from the given code and give reasons why these functions are recursive. void mergeSort(int a[], int p, int r) { int q; if(p < r) { q = (p + r) / 2; mergeSort(a, p, q); mergeSort(a, q+1, r); merge(a, p, q, r); void merge(int a[], int p, int q, int r) { int b[5]; int i, j, k; k = 0; i = p; j = q+ 1; while(i <= q &&j <= r) { if(a[i] < a[j]) b[k++] = a[i++]; else b[k++] = a[j++]; } while(i <= q) b[k++] = a[i++]; while(j <= r) b[k++] = a[j++]; for(i=r; i >= p; i--) a[i] = b[--k];

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: In c++ write recursive method to count nodes or level of a binary search?

A: Code: #include<iostream>using namespace std;//function for the taking the nodestypedef struct…

Q: Write a recursive function: maximum(lst: list)--> int The function returns the maximum from a list…

A: Complete the recursive function in python language to find the maximum of list elements: Function…

Q: Recursive Functions 1. Without looking at the standard prelude, define the following library…

A: ANSWER:-

Q: Define a function sorted_intersection which • accepts two sequences, and • return a list whose…

A: Here is the python code: See below steps for code.

Q: Please explain how the position of the if-else statement affect the recursion. Please also explain…

A: The process of calling a function by itself is called recursion and the function which calls itself…

Q: Implement a recursive function void deleteMax() on the IntList class (provided). The function will…

A: The below code is an implementation of a linked list. The operations performed are insertion,…

Q: // MergeSortTest.java // Sorting an array with merge sort. import java.security.SecureRandom; import…

A: we have to Use the Code provided in question with a new comparable java object to verify the…

Q: Recursive function tracing: drawing Recursion Tree for Smallest(a, 0, 6), where vector a contains…

A: Given function is, Smallest(a, 0, 6) and the vector elements are {4,5,10,1,20,23,2} The recursive…

Q: 3- If an input for Merge-sort is a sorted list, then the recursive function can be written as as…

Q: cursive Functions Without looking at the standard prelude, define the following library functions…

A: Define the following library functions with recursion without consulting the definitions from the…

Q: You are working for a lumber company, and your employer would like a program that calculates the…

A: Since programming language is not mentioned in the question, we will answer this question in the C++…

Q: A tail recursion is a type of recursion in which the access of the tail pointer of a linked list is…

A: Defined the given statement true or false

Q: void func(vector& names){ sort(names.begin(), names.end()); //(a) for(int i =…

A: New code / replace with this ---> for (int i =1 ; i<namespace(); i++) void…

Concept explainers

Depth First Search

Depth-first search (DFS) also known as Depth First traversal is an algorithm used to traverse or search the nodes in a tree or graph data structure. Traversal usually means visiting all the nodes of a graph. DFS performs in a depth-ward manner. It uses a stack to remember the vertices it has visited. The search starts from the root node, where any arbitrary node is selected as a root node in a graph, and then each node is explored along each branch before performing backtracking. The DFS algorithm uses a recursive technique by following the idea of backtracking. DFS algorithm does this by performing an in-depth search of all the nodes by traversing in a forward direction. If the required node is not found, it starts backtracking to previously visited nodes.

Question

Identify the recursive functions from the given code and give reasons why these
functions are recursive.
void mergeSort(int a[], int p, int r)
{
int q;
if(p < r)
{
q = (p + r) / 2;
mergeSort(a, p, q);
mergeSort(a, q+1, r);
merge(a, p, q, r);
}
void merge(int a[], int p, int q, int r)
{
int b[5];
int i, j, k;
k = 0;
i = p;
j = q + 1;
while(i <= q &&j<= r)
{
if(a[i] < a[j])
b[k++] = a[i++];
else
b[k++] = a[j++];
}
while(i <= q)
b[k++] = a[i++];
while(j <= r)
b[k++] = a[j++];
for(i=r; i >= p; i--)
a[i] = b[--k];
%3D

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Complete the given blanks such that all elements of arr are incremented with 10 after the execution. var arr = [13, 10, 7, 18]; function fun(ele) { return } console.log(arr. _(fun));
Define a recursive function named trim; it takes as its arguments a linked list (the head node of it) and a non-negative integer representing the index of an element in the list. The function mutates the linked list such that all elements that occur after the index is removed. Additionally, the function returns a linked list of all the elements that were moved. If the index value exceeds the length of the linked list, it should raise an IndexError. For example, if we defined a list as l1 = LN(1, LN(2, LN 3))) , calling the function would return the linked list LN(2, LN(3)), and the mutated l1 would become LN(1). You must use recursion. def trim(l: LN, index: int) -> LN:
Python Using recursion only No loops Using such type()function, len()function, indexing, slicing The function must return true(boolean) if a list has sets otherwise returns false def hasSet(lst):
Q3 QuickSort Given the QuickSort implementation from class, provide an 18-element list that will take the least number of recursive calls of QuickSort to complete. As a counter-example, here is a list that will cause QuickSort to make the MOST number of recursive calls: public static List input() { return Accaxsaslist(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); } wwwwwww And here's the QuickSort algorithm, for convenience: algorithm QuickSart Input: lists of integers 1st of size N Output: new list with the elements of lat in sorted order if N < 2 return st pivot Jat[N-1] left = new empty list right = new empty list for index = 0, 1, 2, if lst[i]<= pivot left.add(lat[i]) = else N-2 right add(lat[i]) return QuickSort(left) + [pivot] + QuickSort (right)
void func(vector<string>& names){ sort(names.begin(), names.end()); //(a) for(int i = names.size() - 1; i > 0; --i){. //(b) if(names[i] == names[i - 1]){ names[i] = move(names.back()); names.pop_back(); } } } What are the reasons or consequences for the programmer’s choice to loop backwards in the line marked (b), and under what circumstances would the algorithm behave differently if that line were replaced with: for (int i = 1; i < names.size(); ++i) ? What would change?
Python code Screenshot and code is must