Databases
StackOverflow2013
Postsdbo
PORecursion Troubles
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PORecursion Troubles
    primarykey
    data
    text
    <pre><code>import java.util.Arrays; import java.util.ArrayList; import java.util.Scanner; import java.util.Collections; import java.util.List; public class TennisTournament { public static void main (String [] args) { Scanner input = new Scanner(System.in); ArrayList &lt;Integer&gt; nums = new ArrayList&lt;Integer&gt;(); while (input.hasNextInt()) { nums.add(input.nextInt()); } System.out.println(nums); tournament(nums); } public static void tournament(ArrayList &lt;Integer&gt; list) { int midPoint = list.size()/2; // returns the index number of half of the lists size int midPoint2 = list.size()/2; if (list.size() != 1 || midPoint != 1) { for (int i = 0; i &lt; midPoint2; i++) { // while is bigger than mid point, increment by one if (list.get(i) &lt; list.get(midPoint)) { Collections.swap(list, i, midPoint); } midPoint++; } System.out.println(list); int newPoint = midPoint2/2; midPoint2 = newPoint; } tournament(list); } } </code></pre> <p>Okay, so I'm quite new to idea of recursion and right now, all I'm getting is an infinite loop. So in the first method, I wanted to analyse to the array by dividing it in half, and and compare the first element of the first half of the array with the first element of the second half of the array, and if the second element was bigger, then swap And that's all working fine, it's doing exactly what I want it to do. [3, 5, 8, 2, 1, 7, 6, 4] [3, 7, 8, 4, 1, 5, 6, 2] The next step I want to take is I just want to half the elements i'm working on. So in the first instance, I wanted to half the number of elements i'm working, so instead of 0-list.size, i want it to work on 0-list.size()/2, so it will only swap the first four numbers, and then do it again, on 2 numbers until the mid point becomes one. Just a little insight on how I could achieve that would be great. And no, not homework.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. UScourtney
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. PORecursion Troubles
      1. This table or related slice is empty.
      1. VTClose
    2. VO
      singulars
      1. PORecursion Troubles
      1. USCorbin
      1. VTFavorite
    3. VO
      singulars
      1. PORecursion Troubles
      1. This table or related slice is empty.
      1. VTUpMod
    1. COI'm tempted to tag this as homework. Is it?
      singulars
      1. PORecursion Troubles
      1. USBrandon DuRette
    2. COWhat is the "ending condition" for the recursion? As it stands it seems like no matter what it just calls `tournament()` with the original unmodified list, forever. It's never called with a smaller list, nor is there anything that stops the recursive call.
      singulars
      1. PORecursion Troubles
      1. USDave Newton
    3. CO@Brandon: Note last line in the question: _And no, not homework._ :)
      singulars
      1. PORecursion Troubles
      1. USsarnold
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload