Generic merge sort Program Plan: Import the required packages. Create a class “Sorting”: Method to sort the numbers gets defined. Call the method merge sort that implements the comparable interface. Method to sort the string given. Define the main method Initialize the list that needs to be sorted. Call the merge sort. Display the sorted list. Initialize list that contain strings. Call the method merge sort. Display the sorted list. Define the method “mergeSort()” Condition to validate the list contains more than one element. First half of the list is sorted by calling the merge1 method Loop that iterates to sort the values of the list. Second half of the list is sorted by calling the merge method Loop that iterates to sort the values of the list. Both the list gets merged. Define the method “merge1()” Perform swap operation by comparing the list. Return the value.

Question

Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) int count(int num) This will return the count of the instances of the element num in the list. In the linked list in removeAll method, having the method count(10) will return 3 as there are three 10's in the linked list. Additionally, you are to implement these methods: bool move(int pos1, int pos2) This method will move the element at position pos1 to the position specified as pos2 and will return true if the move is successful. This will return false if either the specified positions is invalid. In the example stated, operating the method move(1, 3) will move the 1st element and shall now become the 3rd element. The linked list shall now look like: 30 -> 40 -> 10 -> 50 int removeTail() This method will remove the last element in your linked list and return the said element. If the list is empty, return 0. You can use the…

Answer 1

Question

Chapter 23, Problem 23.2PE

Program Plan Intro

Generic merge sort

Program Plan:

Import the required packages.

Create a class “Sorting”:

Method to sort the numbers gets defined.

Call the method merge sort that implements the comparable interface.

Method to sort the string given.

Define the main method

Initialize the list that needs to be sorted.

Call the merge sort.

Display the sorted list.

Initialize list that contain strings.

Call the method merge sort.

Display the sorted list.

Define the method “mergeSort()”

Condition to validate the list contains more than one element.

First half of the list is sorted by calling the merge1 method

Loop that iterates to sort the values of the list.

Second half of the list is sorted by calling the merge method

Loop that iterates to sort the values of the list.

Both the list gets merged.

Define the method “merge1()”

Perform swap operation by comparing the list.

Return the value.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) int count(int num) This will return the count of the instances of the element num in the list. In the linked list in removeAll method, having the method count(10) will return 3 as there are three 10's in the linked list. Additionally, you are to implement these methods: bool move(int pos1, int pos2) This method will move the element at position pos1 to the position specified as pos2 and will return true if the move is successful. This will return false if either the specified positions is invalid. In the example stated, operating the method move(1, 3) will move the 1st element and shall now become the 3rd element. The linked list shall now look like: 30 -> 40 -> 10 -> 50 int removeTail() This method will remove the last element in your linked list and return the said element. If the list is empty, return 0. You can use the…

java program: University of Bahrain College of Information Technology Department of Computer Science Second Semester, 2020-2021 ITCS214 / ITCS215 / ITCS216 (Data Structures) Assignment 3 Implement generic class ArrayStack as discussed in the lectures having following methods: constructor, push, pop, peek, isEmpty, copy constructor, reallocate (private method). Also add following methods to this class: size: returns number of elements in the stack. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Implement generic class ArrayQueue as discussed in the lectures having following methods: constructor, copy constructor, offer, poll, peek, isEmpty, reallocate(private), iterator. Inner class Iter that implements interface Iterator having methods: constructor, hasNext, next. Also add following methods to the ArrayQueue class: size: returns number of elements in the queue. contains: Search…

Topic: SIngly Linked ListUsing C++ Programming, improve the implemented following function. Initial code is attached below. int count(int num) This will return the count of the instances of the element num in the list. In the linked list in removeAll method, having the method count(10) will return 3 as there are three 10's in the linked list. int count(int num) { int count = 0; for(int i=1; i<index;i++){ if(get(i)== num){ count++; } } return count; } OUTPUT: 1 2 3 4 5 6 7 8 9 2 0 0 10 -> 30 -> 40 -> 10 -> 20 -> 40 -> 10 EXPECTED OUT PUT: 1 2 3 4 5 6 7 8 9 2 10 40 10 -> 30 -> 40 -> 10 -> 20