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

Similar questions

Identify the recursive functions from the given code and give reas ons why these functions are recursive. void mergeSort(int a[], int p, int r) { int q; if(p = p; i--) a[i] = b[--k];
1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).
1. Recursion & List processing Write a recursive function flatten that takes a list as an argument and returns the flat version of that list. For example, (flatten '(a (b c) d)) -> (a b c d) (flatten '(((a)) (b (c)) d)-> (a b c d)
Write 2 recursive functions 1. to count number of even values in an array 2. to count number of even values in a simply linked list
Implement a recursive C++ function which takes an integer array (A) and the starting (start) and ending(end) indices of that array, and returns the sum of all elements present in that array. The prototype ofyour function should be:int findSum (int* A, int start, int end)
Write a recursive Java function displayOutIn that displays two items from an array list at one instance from out-to-in. until one or last two items displayed and the process stops. For example, given array A = {15, 74, 106, 10, 9, 86, 34} the displayOutIn function displays the following: 15, 34 74, 86 106, 9 10
Write code for circular queues method (Deque) using array data structure which should: Delete the element from array(queue) from front and vacate space for new element to insert (Not Replace). Hint: Make a new queue to store remaining elements at previous positions of queue. Please consider above scenario as problem is above scenario otherwise the other method is clear. Please!!! (Code in C++ Don't use pointers)
Write a recursive function: maximum(lst: list)--> int The function returns the maximum from a list of integers.
Consider the following function:int mystery(NodeInt32* node){int counter = 0; while (node != NULL) {counter++;node = node->next; } return counter;}(a)The mystery function is recursive.A. True B. False
function recursion(B[0..n − 1], i) if n == 0 then return False if n == 1 then return (B[0] == i)x ← recursion(B[0........n/2 − 1], i) y ← recursion(B[n/2..........4 × n/2 − 1], i) z ← recursion(B[4 × n/2..........n − 1], i) return (x OR y OR z) input array is of length n = 2^p, p is a positive integer Write the recursive formula for above algorithm as of worst case inputs.
Implement the following code using array implementation of stack in C language: Please modify the given code with all of it's functions, I don't want a new code. #include<stdio.h>#include<stdlib.h>#include<string.h> struct node{char data[100];struct node* next;}; int elements = 0;// function for add values to stackstruct node* add(struct node* stack, char *str){struct node* tp = (struct node*)malloc(sizeof(struct node)) ;strcpy(tp->data,str);tp->next = stack;elements++;return tp;}//redo functionvoid redo(){elements++;}//undo functionvoid undo(){elements--;} //print functionint print(struct node* stack,int idx){if(stack == NULL)return 0;idx = print(stack->next,idx);if(idx<elements)printf("%s\n",stack->data);return idx+1;} //function for save in fileint save_command(FILE* filePointer, struct node* stack,int idx){if(stack == NULL){return 0;}idx = save_command(filePointer,…
C++ Programming RECURSION AND ITS USE IN PROGRAMMING. Write a program for this task using recursion. Development of a recursive triad. Create a recursive call tree for a recursive algorithm. Task : Given an array of size N. Create a function to determine the element that is farthest from the arithmetic mean value of the array elements (that is, the maximum difference by the module).