I was provided with the following code. However, when executing it goes to an infite loop and cannot seem to ppass by that.public int compares(Card c1, Card c2){ // TODO: implement this method if(c1.getSuit() > c2.getSuit()) return 1; if(c1.getSuit() < c2.getSuit()) return -1; else { if(c1.getRank() > c2.getRank()) return 1; if (c1.getRank() < c2.getRank()) return -1; else return 0; }public void quickSortRec(Card[] cardArray, int first, int last) { if (first < last) { int splitPoint; splitPoint = split(cardArray, first, last); quickSortRec(cardArray, first, splitPoint); quickSortRec(cardArray, splitPoint + 1, last); }}public int split(Card[] cardArray, int first, int last){ Card splitValue = cardArray[first]; while(first <= last) { while(compares(cardArray[first],splitValue) == -1) { first++; } while(compares(cardArray[last],splitValue) == 1) { last--; } if (first <= last) { Card temp = cardArray[first]; cardArray[first] = cardArray[last]; cardArray[last] = temp; first++; last--; } } return first - 1;} IJFile Edit View Navigate Code Refactor Build Run Tools VCS Window HelpTestHomework6 ▼HW6 NewCard.java X Ⓒ Deck.java X Ⓒ Homework6.java XHW6 New C:\Users\rodri\ld1g/…../.idea3>out4public class Homework6>src5{Decks.dat// card comparisonHW6 New.imlpublic int compares (Card c1, Card c2)> III External Libraries{Scratches and Consoles// TODO: implement this methodif(c1.getSuit() > c2.getSuit())return 1;if (c1.getSuit() < c2.getSuit())return -1;else15 Ć{if (c1.getRank() > c2.getRank())TestHomework6 x.jdks\openjdk-17.0.2\bin\java.exe "-javaagent: C:\Program Files\JetBrains\IntelliJ IDEA Community Edition 2021.3.1\lib\idea_rt.jar=54015:C:\Program Fi>>Event LogBuildVersion Control ▶. RunTODO> Problems > TerminalBuild completed successfully in 2 sec, 847 ms (moments ago)59:19 CRLF UTF-8 4 spacesStructureBookmarksRun:OIÊ a IPBEREREB101112131416@HW6 New - Homework6.javaTestHomework6.java XOx:A2 ^ V||

Solution: Given, public int compares(Card c1, Card c2){ // TODO: implement this method…

I was provided with the following code. However, when executing it goes to an infite loop and cannot seem to ppass by that. public int compares(Card c1, Card c2){ // TODO: implement this method if(c1.getSuit() > c2.getSuit()) return 1; if(c1.getSuit() < c2.getSuit()) return -1; else { if(c1.getRank() > c2.getRank()) return 1; if (c1.getRank() < c2.getRank()) return -1; else return 0; } public void quickSortRec(Card[] cardArray, int first, int last) { if (first < last) { int splitPoint; splitPoint = split(cardArray, first, last); quickSortRec(cardArray, first, splitPoint); quickSortRec(cardArray, splitPoint + 1, last); } } public int split(Card[] cardArray, int first, int last){ Card splitValue = cardArray[first]; while(first <= last) { while(compares(cardArray[first],splitValue) == -1) { first++; } while(compares(cardArray[last],splitValue) == 1) { last--; } if (first <= last) { Card temp = cardArray[first]; cardArray[first] = cardArray[last]; cardArray[last] = temp; first++; last--; } }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

100%

I was provided with the following code. However, when executing it goes to an infite loop and cannot seem to ppass by that.

public int compares(Card c1, Card c2){
// TODO: implement this method
if(c1.getSuit() > c2.getSuit())
return 1;

if(c1.getSuit() < c2.getSuit())
return -1;

else
{

if(c1.getRank() > c2.getRank())
return 1;

if (c1.getRank() < c2.getRank())
return -1;

else
return 0;

}

public void quickSortRec(Card[] cardArray, int first, int last) {
if (first < last) {
int splitPoint;
splitPoint = split(cardArray, first, last);

quickSortRec(cardArray, first, splitPoint);
quickSortRec(cardArray, splitPoint + 1, last);
}
}

public int split(Card[] cardArray, int first, int last){
Card splitValue = cardArray[first];

while(first <= last) {
while(compares(cardArray[first],splitValue) == -1) {
first++;
}

while(compares(cardArray[last],splitValue) == 1) {
last--;
}

if (first <= last)
{
Card temp = cardArray[first];
cardArray[first] = cardArray[last];
cardArray[last] = temp;
first++;
last--;
}
}
return first - 1;
}

IJ
File Edit View Navigate Code Refactor Build Run Tools VCS Window Help
TestHomework6 ▼
HW6 New
Card.java X Ⓒ Deck.java X Ⓒ Homework6.java X
HW6 New C:\Users\rodri\ld
1
g/…../
.idea
3
>
out
4
public class Homework6
>
src
5
{
Decks.dat
// card comparison
HW6 New.iml
public int compares (Card c1, Card c2)
> III External Libraries
{
Scratches and Consoles
// TODO: implement this method
if
(c1.getSuit() > c2.getSuit())
return 1;
if (c1.getSuit() < c2.getSuit())
return -1;
else
15 Ć
{
if (c1.getRank() > c2.getRank())
TestHomework6 x
.jdks\openjdk-17.0.2\bin\java.exe "-javaagent: C:\Program Files\JetBrains\IntelliJ IDEA Community Edition 2021.3.1\lib\idea_rt.jar=54015:C:\Program Fi
>>
Event Log
Build
Version Control ▶. Run
TODO
> Problems > Terminal
Build completed successfully in 2 sec, 847 ms (moments ago)
59:19 CRLF UTF-8 4 spaces
Structure
Bookmarks
Run:
O
IÊ a IP
BEREREB
10
11
12
13
14
16
@
HW6 New - Homework6.java
TestHomework6.java X
O
x
:
A2 ^ V
||

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions