Databases
StackOverflow2013
Postsdbo
POPseudocode of this Algorithm using Java
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POPseudocode of this Algorithm using Java
    primarykey
    data
    text
    <p>There is something wrong with my code. My goal is to translate the pseudocode into java code Yes my coding is an assignment, I don't want any answer just to show me where the problem is</p> <p>What I have to do is to compute the size of the intersection between two unsorted list of students containing no duplicates.</p> <p>I will show the pseudocode and my java code corresponding to this pseudocode.</p> <p>Pseudo code:</p> <pre><code>inter &lt;-- 0 Array C[m+n] for i &lt;-- 0 to m-1 do C[i] &lt;-- A[i] for i &lt;-- 0 to n-1 do C[i+m] &lt;-- B[i] C &lt;-- sort(C, m+n); pointer &lt;-- 0 while (pointer &lt; m+n-1) do{ if(C[pointer]=C[pointer+1]){ inter &lt;-- inter+1 pointer &lt;-- pointer+2 } else pointer &lt;-- pointer+1 } return inter </code></pre> <p>Java Code:</p> <pre><code>public static int intersectionSizeMergeAndSort(studentList L1, studentList L2) { /* Write your code for question 4 here */ int intersectionSize = 0; int[] C = new int[L1.studentID.length+L2.studentID.length]; for(int i = 0; i&lt;L1.studentID.length; i++){ C[i] = L1.studentID[i]; } for(int i = 0; i&lt;L2.studentID.length; i++){ C[i+L1.studentID.length] = L2.studentID[i]; } Arrays.sort(C); int pointer = 0; while(pointer&lt;((C.length-1))){ if(C[pointer] == C[pointer+1]){ intersectionSize = intersectionSize + 1; pointer = pointer + 2; } else { pointer = pointer + 1; } return intersectionSize; } return 0; } </code></pre> <p>My main method:</p> <pre><code>public static void main(String args[]) throws Exception { studentList firstList; studentList secondList; // This is how to read lists from files. Useful for debugging. // firstList=new studentList("COMP250.txt", "COMP250 - Introduction to Computer Science"); // secondList=new studentList("MATH240.txt", "MATH240 - Discrete Mathematics"); // get the time before starting the intersections long startTime = System.currentTimeMillis(); // repeat the process a certain number of times, to make more accurate average measurements. for (int rep=0;rep&lt;1000;rep++) { // This is how to generate lists of random IDs. // For firstList, we generate 16000 IDs // For secondList, we generate 16000 IDs firstList=new studentList(2 , "COMP250 - Introduction to Computer Science"); secondList=new studentList(2 , "MATH240 - Discrete Mathematics"); // run the intersection method int intersection=studentList.intersectionSizeMergeAndSort(firstList,secondList); System.out.println("The intersection size is: "+intersection); } // get the time after the intersection long endTime = System.currentTimeMillis(); System.out.println("Running time: "+ (endTime-startTime) + " milliseconds"); } } </code></pre> <p>Note: L1 and L2 have been declared previously But I am not getting the results I am aiming for. Can someone point out what is wrong ?</p> <p>Thank you</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USRalph
    1. USRalph
    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. POPseudocode of this Algorithm using Java
      1. This table or related slice is empty.
      1. VTDownMod
    2. VO
      singulars
      1. POPseudocode of this Algorithm using Java
      1. This table or related slice is empty.
      1. VTDownMod
    3. VO
      singulars
      1. POPseudocode of this Algorithm using Java
      1. This table or related slice is empty.
      1. VTApproveEditSuggestion
    1. COWhat results do you get? What results do you expect? Can you isolate where the problem occurs and when? Did you do any debugging? Stepping?
      singulars
      1. POPseudocode of this Algorithm using Java
      1. USEmil Vikström
    2. COOkay excuse me I am going to edit the code and show my main method
      singulars
      1. POPseudocode of this Algorithm using Java
      1. USRalph
    3. COI am expecting the intersection between the two lists. The problem is that the code compiles, but while I am expecting a result as follows:
      singulars
      1. POPseudocode of this Algorithm using Java
      1. USRalph
 

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