I need help solving this c++ problem as I need to create a sorting class template of the programming base on the instruction of the assignment. In short-term how I can solve this coding problem and creating Menu-driven implementation. Step 3: Refactor your sort function as a member function of a Class Template that has a datastore. Your Class Template must have member functions to add data, display data, and sortdata. Your data store can consist of an array of fixed length using an index (such as top in aStack Implementation). Other data store implementations are acceptable.Step 4: Test your Class Template using at least two template objects with at least 5 dataelements for each object. Menu-driven implementation (i.e. using design patterns fromAssignments 1 & 2 for example) are also acceptable. A simple main implementation wouldbe as follows:int main (){Stack numbers;numbers.push (212);numbers.push (315);numbers.push (175);numbers.push (258);numbers.push (110);numbers.display();numbers.sort();numbers.display();Stack names;names.push ("Frodo");names.push ("Eowyn";names.push ("Sauron");names.push("Bilbo")names.push("Galadriel")names.display();\\names.sort();names.display();return 0;} Assignment 6 – Sorting with Class TemplatesCSIS 123A – Duffie (f2020)Executive Summary: For Assignment 6 implement a sort algorithm as part of a ClassTemplate. Test your Class Template in main by inputting, sorting, and displaying data of atleast two types (one string, and one numeric). Insertion sort was covered in class and can beused for this assignment. Candidate sort algorithms for this assignment also includeSelection Sort, Merge Sort, and Quick Sort. Extra Credit consideration will be given forimplementations that use alternate or multiple sort algorithms (other than insertion), orimplementations that read data from a file (implementations that read from a file do notneed an additem or push method).Implementation Notes:Step 1: It is suggested that you start by implementing a sort algorithm as a simple programin main(). Try and understand how the algorithm works, and take some time to considerhow the code would need to change in order to accommodate other primitive types (i.e.double, string, etc.), as well as a variable number of items.//Insertion Sortint main (){int values[]{ 10,50,40,30,20,60,70,90,100,80};int hold0;int search0;%3Dfor (int current1; current < 10; current++){hold = values [current];for (searchcurrent1; search >= 0 && hold < values [search]; search--)values [search];values [search + 1]hold;values [search + 1]}for (int x= 0; x < 10; x++)cout << values[x] << endl;return 0;}Step 2: Implement and test your sort routine as a simple function. Consider implementingas a Function Template as a stepping-stone to implementing a Class Template.

Objective: This program implements the stack data structure using the template class and sort…

Step 3: Refactor your sort function as a member function of a Class Template that has a data store. Your Class Template must have member functions to add data, display data, and sort data. Your data store can consist of an array of fixed length using an index (such as top in a Stack Implementation). Other data store implementations are acceptable. Step 4: Test your Class Template using at least two template objects with at least 5 data elements for each object. Menu-driven implementation (i.e. using design patterns from Assignments 1 & 2 for example) are also acceptable. A simple main implementation would be as follows: int main ()

Step 3: Refactor your sort function as a member function of a Class Template that has a data store. Your Class Template must have member functions to add data, display data, and sort data. Your data store can consist of an array of fixed length using an index (such as top in a Stack Implementation). Other data store implementations are acceptable. Step 4: Test your Class Template using at least two template objects with at least 5 data elements for each object. Menu-driven implementation (i.e. using design patterns from Assignments 1 & 2 for example) are also acceptable. A simple main implementation would be as follows: int main ()

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 15PE

See similar textbooks

Similar questions

***PLEASE ANSWER QUESTION 2. THE FOR CONSTRUCT IS COMPLETED ABOVE IT. I NEED IT DONE WITH PROPER SCOPE, NO DEEP COPIES. THANK YOU*** function for_(cur, cond, next, fbody) { if (cond(cur)) { fbody(cur); for_(next(cur), cond, next, fbody); } } exports.for_ = for_; /* QUESTION 2 (5pts): * * Using the above for_ construct, you will now implement a construct for * iterating over elements of an array. each takes a list and a function f. For * each element in the list, the function calls f with the element and the * index of the element in the list. */ function each(list, f) { if (list.size == 0) { return; } //FILL IN ********* } exports.each = each; ***PLEASE ANSWER QUESTION 2. THE FOR CONSTRUCT IS COMPLETED ABOVE IT. I NEED IT DONE WITH PROPER SCOPE, NO DEEP COPIES. THANK YOU***
Write a comparator for Person named SectorPayOrder that will allow a primary sort in ascending order of sector, and a secondary sort in ascending order of payrate where sectors match. example code public int compareTo(Person other) { return (this.getDobDay()>other.getDobDay()?1:(this.getDobDay()<other.getDobDay()?-1:0)); }} class PayOrder implements Comparator<Person> { public int compare(Person p1, Person p2) { if (p1.getPay()>p2.getPay()) return 1; else { if (p1.getPay()<p2.getPay()) return -1; else return 0; } //try this -- return p1.getPay() - p2.getPay(); } }
Suppose we have class named NumberList that holds a linked list of double values. In this section you will modify the class by adding recursive member functions. The functions will use recursion to traverse the linked list and perform the following operations: • Count the number of nodes in the list. To count the number of nodes in the list by recursion, we introduce two new member functions: numNodes and countNodes. countNodes is a private member function that uses recursion, and numNodes is the public interface that calls it. • Display the value of the list nodes in reverse order. To display the nodes in the list in reverse order, we introduce two new member functions: displayBackwards and showReverse. showReverse is a private member function that uses recursion, and displayBackwards is the public interface that calls it.
Declare and implement 5 classes: FloatArray, SortedArray,FrontArray, PositiveArray & NegativeArray.1- The FloatArray class stores a dynamic array of floats and itssize. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the arrayelements from the file (ifstream) and add them to the array.- A destructor to deallocate the array2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add tothe array then sort but rather add in the right place.3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the front of the…
Declare and implement 5 classes: FloatArray, SortedArray,FrontArray, PositiveArray & NegativeArray.1- The FloatArray class stores a dynamic array of floats and itssize. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the arrayelements from the file (ifstream) and add them to the array.- A destructor to deallocate the array2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add tothe array then sort but rather add in the right place.3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the front of the…
Implement a __setitem__ function that also supports negative indices. For example: W = L2(Node(10, Node(20, Node(30))))print W[ 10, 20, 30 ] W[1]=25print W[ 10, 25, 30 ] W[-1]=35print W[ 10, 25, 35 ] Complete the code: def L2(*args,**kwargs): class L2_class(L): def __getitem__(self, idx): <... YOUR CODE HERE ...> def __setitem__(self, idx, value): <... YOUR CODE HERE ...> return L2_class(*args,**kwargs) W = L2(Node(10, Node(20, Node(30))))print(W)W[1]=25print(W)W[-1]=35print(W)
JAVA PROGRAMMING Q4.1: You have two sequences of mutually-comparable items to sort: The sequences are identical in terms of their sizes, their items, and the current (unsorted) order of those items. One sequence is in an array and the other is in a linked list. For the array and the link list, make an argument for why the quick sort would be best for one and the merge sort for the other. In the identified situation, give a quantitative answer based on big-O and other technical factors, not just a qualitative answer. Address the specifics of the two algorithms -- their operations, time efficiency, money use, etc. Assume no optimization Q4.2: Explain and/or illustrate the specific changes made in each pass of an Insertion Sort on the following data: 47 4 22 13 9 12
Python Please Recap of two-dimensional arrays and their numpy implementation ** uploaded image ^ 1) In this problem, implement a TwoDArray class that is meant to mimic (some of) the functionality of a two-dimensional numpy array. DO NOT use numpy at any point. 1A) Give the class an __init__ method Make sure that the variable array is a valid input. This means you should a) Make sure that array is a list of lists. and b) Make sure that each of the inner lists has the same length. You do not need to check for anything else. If these conditions are not met you should raise the appropriate error(s). It is up for you to decide if you should raise a TypeError, KeyError, IndexError, ValueError, ZeroDivisionError, etc. When raising the error, you should also give an informative error message. With actual numpy arrays, all numbers are required to be the same datatype. You don't have to worry about that here. You can also assume that all numbers are ints or floats so you only have to worry…
Python Please Recap of two-dimensional arrays and their numpy implementation ** uploaded image ^ 1) In this problem, implement a TwoDArray class that is meant to mimic (some of) the functionality of a two-dimensional numpy array. DO NOT use numpy at any point. 1A) Give the class an __init__ method Make sure that the variable array is a valid input. This means you should a) Make sure that array is a list of lists. and b) Make sure that each of the inner lists has the same length. You do not need to check for anything else. If these conditions are not met you should raise the appropriate error(s). It is up for you to decide if you should raise a TypeError, KeyError, IndexError, ValueError, ZeroDivisionError, etc. When raising the error, you should also give an informative error message. With actual numpy arrays, all numbers are required to be the same datatype. You don't have to worry about that here. You can also assume that all numbers are ints or floats so you only have to worry…
Python Please Recap of two-dimensional arrays and their numpy implementation ** uploaded image ^ 1) In this problem, implement a TwoDArray class that is meant to mimic (some of) the functionality of a two-dimensional numpy array. DO NOT use numpy at any point. 1A) Give the class an __init__ method Make sure that the variable array is a valid input. This means you should a) Make sure that array is a list of lists. and b) Make sure that each of the inner lists has the same length. You do not need to check for anything else. Rise the appropriate error(s) if these conditions are not met. It is up for you to decide if you should raise a TypeError, KeyError, IndexError, ValueError, ZeroDivisionError, etc. When raising the error, you should also give an informative error message.Assume that all numbers are ints or float,s to only worry about checking that the variable array is a list of lists. 1A) def __init__(self, array): self.array = array *** What would be the rest of the code?
TaskDeclare and implement 5 classes: FloatArray, SortedArray,FrontArray, PositiveArray & NegativeArray.1- The FloatArray class stores a dynamic array of floats and itssize. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the arrayelements from the file (ifstream) and add them to the array.- A destructor to deallocate the array2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add tothe array then sort but rather add in the right place.3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the front of…
Declare and implement 5 classes: FloatArray, SortedArray, FrontArray, PositiveArray & NegativeArray 1- The FloatArray class stores a dynamic array of floats and its size. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the array elements from the file (ifstream) and add them to the array.- A destructor to deallocate the array 2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add to the array then sort but rather add in the right place. 3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the front…