I need help implementing those functions.public class DeckCards{// card comparisonpublic int compares(Card c1, Card c2){return - 1; // replace this statement with your own return}// This is the wrapper method for quick sort// Do not make any changes to this method!public void quickSort(Card[] cardArray){quickSortRec(cardArray, 0, cardArray.length - 1);}// This is the recursive helper method for quickSortpublic void quickSortRec(Card[] cardArray, int first, int last){// TODO: implement this method}// This method splits a Card array into two sections, with all the elements less // than the pivot in the left section and all the elements greater than the pivot// in the right sectionpublic int split(Card[] cardArray, int first, int last){// TODO: implement this methodreturn -1; // replace this statement with your own return}// This method takes an int array which represents a complete binary tree as// the parameter. It checks if the tree stored in the array is a heap.public boolean isHeap(int[] A){// TODO: implement this methodreturn false; // replace this statement with your own return}} int compares (Card c1, Card c2)This method takes two card objects and returns -1, 0, or 1 if c1 is smaller, equal to, or greaterthan c2, respectively. You need to compare their suits first and if they have the same suit, thencompare their ranks.void quickSort (Card [] cardArray, int first, int last)This method takes a card array as well as two indices. It sorts the cards in the range specifiedby first and last with quick sort. It first calls the split method to partition the elements inthe range into two subarrays, and sorts both subarrays recursively. It repeats this process untilthe entire array is sorted.int split (Card [] cardArray, int first, int last)This is a helper method for quick sort which takes a card array and two indices. It begins byselecting the first element in the card array as the pivot, and then moves elements so thateverything in the left subarray is smaller than the pivot and everything on the right is greaterthan the pivot. The method returns the final index of the pivot. You will need to call thecompares method to make comparisons between cards.boolean isHeap (int[] A)This method takes an int array as the parameter and verifies if the elements saved in thisarray form a heap. You can assume that the array represents a complete binary tree so theshape property is already satisfied. You will need to verify that the elements meet the orderproperty requirement for heaps. Return true if this is a heap, false otherwise. This method isseparate from the above methods and has nothing to do with the card or Deck classes used byother methods.Note that you are only supposed to touch the above methods. You are NOT allowed tocreate any other methods, instance variables, or make any changes to methods otherthan these methods or files other than "Homework6.java". Points will be taken off if youfail to follow this rule.

Required methods are implemented below:

Answered: int compares (Card cl, Card c2) This…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

I need help implementing those functions.

public class DeckCards
{
// card comparison
public int compares(Card c1, Card c2)
{
return - 1; // replace this statement with your own return
}

// This is the wrapper method for quick sort
// Do not make any changes to this method!
public void quickSort(Card[] cardArray)
{
quickSortRec(cardArray, 0, cardArray.length - 1);
}

// This is the recursive helper method for quickSort
public void quickSortRec(Card[] cardArray, int first, int last)
{
// TODO: implement this method
}

// This method splits a Card array into two sections, with all the elements less
// than the pivot in the left section and all the elements greater than the pivot
// in the right section
public int split(Card[] cardArray, int first, int last)
{
// TODO: implement this method

return -1; // replace this statement with your own return
}

// This method takes an int array which represents a complete binary tree as
// the parameter. It checks if the tree stored in the array is a heap.
public boolean isHeap(int[] A)
{
// TODO: implement this method

return false; // replace this statement with your own return
}
}