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++];elseb[k++] = a[j++];}%3D i = p;j = q + 1;while(i <= q && j <= r){if(a[i] < a[j])b[k++] = a[i++];elseb[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];}

A Recursive function is a function which is calling itself

Answered: Identify the recursive functions from…

Engineering

Computer Science

Identify the recursive functions from the given code and give reasons why these functions are recursive

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 13RQ: How is an array stored in main memory? How is a linked list stored in main memory? What are their...

See similar textbooks

Similar questions

JAVA Help: Mergesort Implement a natural merge sort for linked lists. (This is the method of choice for sorting linked lists because it uses no extra space and is guaranteed to be linearithmic.) During each iteration, natural merge sort works by scanning the list from the left to right identifying naturally sorted sub-lists and merging the sub-lists, and continue scanning further identifying and merging the sub-lists until the end of the list. Repeats the process until the entire list is sorted. Example: Unsorted list M -> E -> R -> G -> E -> S -> O -> R -> T -> E -> X -> A -> M -> P -> L -> E After first iteration: E - > M -> R -> E -> G -> S -> E -> O -> R -> T -> X -> A -> L -> M -> P -> E After second iteration: E -> E -> G -> M -> R -> S -> A -> E -> L -> M -> 0 -> P -> R -> T -> X -> E After third iteration: A -> E -> E -> E -> G…
Implement a city database using ordered lists. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name. Another operation that should be supported is to print all records within a given distance of a specified point/coordinate. The order of cities should be alphabetically by city name. Implement the database using: an array- based list implementation. By using JAVA.
Implement a city database using ordered lists by using java. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name. Another operation that should be supported is to print all records within a given distance of a specified point/coordinate. The order of cities should be alphabetically by city name. Implement the database using both: an arraybased list implementation, and a circular single linked list implementation.Use may the following node, SLL implementations to implement an ordered circular single linked list
09.Given a linked list of N nodes such that it may contain a loop. A loop here means that the last node of the link list is connected to the node at position X(1-based index). If the link list does not have any loop, X=0. Remove the loop from the linked list, if it is present, i.e. unlink the last node which is forming the loop. Example 1: Input: N = 3 value[] = {1,3,4} X = 2 Output: 1 Explanation: The link list looks like 1 -> 3 -> 4 ^ | |____|
Given pointers to the head nodes of linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share a common node, return that node's value. Note: After the merge point, both lists will share the same node pointers. Example In the diagram below, the two lists converge at Node x: [List #1] a--->b--->c \ x--->y--->z--->NULL / [List #2] p--->q Function Description Complete the findMergeNode function in the editor below. findMergeNode has the following parameters: SinglyLinkedListNode pointer head1: a reference to the head of the first list SinglyLinkedListNode pointer head2: a reference to the head of the second list Returns int: the value of the node where the lists merge Input Format Do not read any input from…
A singly linked list can be reversed by altering the nodes' pointers. The original list's nodes should still contain the data that the list represents.For instance, if a single linked list START is supplied, as in Figure P6.9(a), the list must be reversed using just the links, as in Figure P6.9(b).
Using NetBeans, perform the following. 1. Convert one (1) sample Python script in 02 Handout 1 into Java code. The first letter of your first name will be the basis of your assigned recursion type. First Names Recursion Type A-F Linear recursion G-L Tail recursion M-R Binary recursion S-Z Mutual recursion 2. Create and print a linked list with four (4) elements. The first letter of your last name will be the basis of the required values for your linked list. Last Names Values A-E Ice cream flavors F-J Cartoon/anime characters K-O Favorite mobile apps P-S Favorite movie/game characters T-Z Dream gadgets Upload the .java file and a screenshot of your output.
Short answer Answer the following in your own words: Your friend says they implemented a stack as a linked list with reference pointers to both a head and the tail node (i.e. they implemented a stack as a double ended linked list). They said this significantly improved the performance for all functions (push, pop, search, and update). Are they correct? Why or why not? Another friend implemented a queue as a linked list with only a head pointer (no tail node). She said this made performance of all functions (insert, remove, search, and update) categorically equal to a queue as a linked list with a head and a tail node. Is she correct? Why or why not?
Assume an open addressing hash table implementation, where the size of the array is N = 19, and that double hashing is performed for collision handling. The second hash function is defined as: d(k) = q -k mod q, where k is the key being inserted in the table and the prime number q is = 7. Use simple modular operation (k mod N) for the first hash function. i) Show the content of the table after performing the following operations, in order:put(45), put(25), put(12), put(61), put(38), put(88), remove(12), put(39), remove(61), put(18), put(29), put(29), put(35).i) What is the size of the longest cluster caused by the above insertions? ii) What is the number of occurred collisions as a result of the above operations? iii) What is the current value of the table’s load factor?
1-Write a C program to show operations on a singly linked where each node consists of integers. (a) Insert (At beginning, At end) (b) Delet (At beginning, At end) (c) Search (d)reverse (e) Print middle element 2 Write a C program using dynamic variable & pointers to construct a singly linked list consisting of the following information in each node. Student id (integer), student name (character string) & semester (integer). 3 Write a C program using dynamic variables & pointers to construct an ordered (ascending) singly linked list based on the rank of the student, where each node consists of the following information student id( integer) student name(character), rank(integer).
The following are the operations that you can do using a single linked list. Choose only one operation then create the algorithm and simulate. The attached Rubric will be used in evaluating the activity. 1. Delete a particular node in a single linked list 2. Delete the first node of a single linked list 3. Insertion after a given node of a single linked list 4. Insertion at a given position in a single linked list 5. Insertion before a given node in a single linked list 6. Reverse a single linked list EX: Delete the last node of a single linked list Problem" Deletion of the last node in a single linked list Algorithm" Step 1: if HEAD = NULL Write UNDERFLOW Go to Step 8 Step 2: SET PTR = HEAD Step 3: Repeat Steps 4 and while PTR à NEXT = NULL Step 4: SET PREPPTR = PTR Step 5: SET PTR =PTR à NEXT [End of loop] Step 6: SET PREPTR à NEXT = NULL Step 7: FREE PTR Step 8: EXIT…
Answer the following in your own words: Your friend says they implemented a stack as a linked list with reference pointers to both a head and the tail node (i.e. they implemented a stack as a double ended linked list). They said this significantly improved the performance for all functions (push, pop, search, and update). Are they correct? Why or why not? Another friend implemented a queue as a linked list with only a head pointer (no tail node). She said this made performance of all functions (insert, remove, search, and update) categorically equal to a queue as a linked list with a head and a tail node. Is she correct? Why or why not?