Write a Java method using recursion that reorders an integer array in such a way that all the even values comes before the odd valuesHere is the code to start, fill in the missing part output should be 8 6 2 4 4 4 4 3 5 5 3 7 1 9 12345 6 7 8 91pn345 1 0 31101112161718192021public class MyClass {static void organize(int[] data, int low, int high) {}}//code here// Hint: one way is to code similar to binary search and use the// low and high//code herestatic void organize(int[] data) {//helper functionorganize (data, 0, data.length - 1);}}public static void main(String args[]) {int[] data = {1,2,3,3,4,4,4,4,5,5,6,7,8,9};organize(data);for (int i : data) {}// accessing each element of arraySystem.out.print(i + ' ");Java

In this question we have to complete the Java code provided for the above problem statement Let's…

Write a Java method using recursion that reorders an integer array in such a way that all the even values comes before the odd values Here is the code to start, fill in the missing part output should be 8 6 2 4 4 4 4 3 5 5 3 7 1 9

Write a Java method using recursion that reorders an integer array in such a way that all the even values comes before the odd values Here is the code to start, fill in the missing part output should be 8 6 2 4 4 4 4 3 5 5 3 7 1 9

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 10PE

See similar textbooks

Similar questions

java program Create a class Term. This class represents a term of a polynomial such as 2x4 where 2 is coefficient and 4 is exponent of the term.Data members:-• int coefficient• int exponentCreate another class Polynomial. The internal representation of a polynomial is an array of Terms. The size of this array should be fixed.Provide a constructor for this class that will set all terms of a polynomial object as zero (where coefficient is 0 and exponent is 0). Provide following functions:• setTerm(int, int) – Setting a term of a polynomial object. Each successive call of this function should set next term of the polynomial object.It should do the following validations:-• Whether the exponent of the term being set is already used.• Whether the array size limit is exceeded.• Whether the exponent is negative.In all the cases it should not set the term and display an appropriate message.• sort() – to arrange the terms in ascending order of exponents.• provide a function to print a polynomial…
Start with this class declaration: class Student { int sId; String name; double gpa;} Implement a Comparable and Comparator interface to provide the following three (3) alternative ways of ordering for the Student objects - based on sId (i.e., assume that this is selected as the natural ordering)- based on name, - based on gpa. Next declare a list of five Student objects, initialize them with random values. Test your code by printing out each of the following on separate lines: (original list of students, sorted list of students in ascending sId order, sorted list of students in ascending name order, sorted list of students in ascending gpa order).
Main Class Implement a main class that implements our ParkingOffice.java class. Parkingoffice.java public class ParkingOffice {String name;String address;String phone;String parkingOfficeName;List<Customer> customers;List<Car> cars;List<ParkingLot> lots;List<ParkingCharge> charges; public ParkingOffice(){customers = new ArrayList<>();cars = new ArrayList<>();lots = new ArrayList<>();charges = new ArrayList<>();} public String getParkingOfficeName(){return this.parkingOfficeName;} /* to implement the desired park function */ public String park(Date date,String ParkingPermit,ParkingLot pl){ /* to have the amount paid during the transaction forthe specified parking lot */double amount=pl.amount;/* to have the date on which the parking lot is booked */String onDate=date.toString();/* to know the permit id */String permitId=ParkingPermit;/* to print the transaction receipt */String s="Amount paid on date: ";s=s+onDate;s=s+" is…
ADD CODE IN LINE 13, where it is written //your code goes below here Assume the following class fully implemented 1. class Olympic2. {3. char* m_name;4. public:5. Olympic(const char* name);6. Olympic(const Olympic& ro);7. Olympic& operator=(const Olympic& ro);8. void setName(const char* name);9. virtual void mission();10. std::ostream& display(std::ostream& os = std::cout);11. virtual ~Olympic();12. };13. std::ostream& operator<<(std::ostream& os, Olympic& r);14. Implement the copy constructor and copy assignment operator of the derived class Runner in a way that derived class and base class' object attributes are properly handled. 1. class Runner :public Olympic2. 3. {4. int m_speed;5. char* m_colour = nullptr;6. public:7. // assume these functions are fully implemented and working perfectly8. Runner(const char* name = "John", const char* c_colour = "blue", int power = 5);9. void setColour(const char* c_colour);10. std::ostream&…
JAVA PROGRAM ASAP *********** THIS PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES. Please create a program BECAUSE IT IS. MY HOMEWORK ASSIGNMENT with the following parts which are down below: The left index is inclusive and the right index is exclusive. 1. public static void bubbleSort(int[] array, int left, int right) { // your code here } 2. public static void insertionSort(int[] array, int left, int right) { // your code here } 3. public static void selectionSort(int[] array, int left, int right) { // your code here } Test Case 1 Please enter a space separated list of numbers to sort or type QUIT to exit:\n4 3 2 1ENTERSorting first half of the array using Bubble Sort algorithm:\n3 4 2 1\nSorting second half of the array using Bubble Sort algorithm:\n4 3 1 2\nSorting the array using Bubble Sort algorithm:\n1 2 3 4\nSorting first half of the array using Insertion Sort algorithm:\n3 4 2 1\nSorting second half of the array using Insertion…
Design a class Line that implements a line, which is represented by the formula y = ax+b. Your class should store a and b as double member variables. Write a member function intersect(ℓ) that returns the x coordinateat which this line intersects line ℓ. If the two lines are parallel, then yourfunction should throw an exception Parallel. Write a C++ program thatcreates a number of Line objects and tests each pair for intersection. Yourprogram should print an appropriate error message for parallel lines.
iTunes is one of several platforms that allow users to stream music for a monthly subscription fee. A user typically organisos their favourite songs in groupings called playlists. Your task is to efficiently implement such a playlist using a binary search tree 1. Create a class Track and write code for the following: 1.1 Encapsulate/hide each attribute by ádding an appropriate modifier to its definition 1.2 A default constructor 1.3 A loaded constructor 14 Accessor methods for each attribute 1,5 Mutator methods for each attribute 1,6 A tostring()method returns a formatted string representation of each attribute for a given track:
Write a smart pointer class. A smart pointer is a data type, usually implemented with templates, that simulates a pointer while also providing automatic garbage collection. It automatically counts the number of references to a SmartPointer<?> object and frees the object of type T when the reference count hits zero.
c# programMake a class called Employees, with attributes Name, Gender, Experience, Salary and ID.Make a delegate called EligiblePromo. This delegate takes an employees object as a parameter and returns a boolean value indication whether or not the employee should be promoted.Make a PromoteEmployee() method that takes an arraylist of Employees and delegate of type EligiblePromo as parametersNB: PromoteEmployee() methos loops through each Employees object and passes it to the delegate(25)
Create a class Department with attributes DName, DID, a dynamic listDTeachers of type string.Write accessors and mutators for all data membersand show function to show all data members.Create nullaryand parameterized constructors to initialize the data members.Also write a copy constructor for Department class.In main() create a dynamic array of departments, Use loop to create four objects in the dynamic array. All the even indexed objects should be created with nullary constructors and thencall the accessors and mutators to initializethe objects while, all the odd indexed objects should be initialized using parameterized constructors. Create four copy objects from array using copy constructors.Call the show function to show the four objects.
java Singly linked list need help with numbers 5 only 1 to 5 is done but they connected 5 is in the picture 1. Create a class called Citizen with the following attributes/variables:a. String citizenIDb. String citizenNamec. String citizenSurnamed. String citizenCellNumbere. int registrationDayf. int registrationMonthg. int registrationYear2. Create a class called Node with the following attributes/variables:a. Citizen citizen b. Node nextNode 3. Create a class called CitizenRegister with the following attributes/variables:a. Node headNodeb. int totalRegisteredCitizens4. Add and complete the following methods in CitizenRegister:a. head()i. Returns the first citizen object in the linked listb. tail()i. Returns the last citizen object in the linked listc. size()i. Returns the totalRegisteredCitizend. isEmpty()i. Returns the boolean of whether the linked list is empty or note. addCitizenAtHead(Node newNode)i. Adds a new node object containing the citizen object information before the…
Solve this using python language Create a KeyIndex class with the following properties : Fields: int [ ] k; Description An array of integers. Note: You may maintain another global variable(java)/instance variable(python) if needed (but you can’t use more than one). Constructor:(10 marks) KeyIndex(int [ ]a) Description: This constructor takes an array of integers a and populates array k with the element in a as indices into k. Note: make sure the build-up of your array k supports negative and non-distinct integers. Methods: search (int val) Description: This method searches for the value val within the array and returns true if found or false otherwise. sort () Description: This method will return the sorted form of the array that had been passed into the constructor. NOTE: Create a tester class or write tester statements to check whether the methods in your KeyIndex class work properly.