Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>You can implement a Selection sort fairly easily with a Stack and Queue:</p> <p>If the data is originally on the stack, put it all on the Queue, and do the following:</p> <pre><code>int size = list.length; // list is the int[] sent as a method parameter. while (size &gt; 0) { // until we've placed all elements in their sorted positions int min = Integer.MAX_VALUE; // make sure the minimum is bigger than all the data for (int i = 0; i &lt; size; i++) { // check all elements in the queue int temp = queue.dequeue(); // mark the current element if (temp &lt; min) min = temp; // if it's a possible minimum record it. queue.enqueue(temp); // place it back in the queue so we don't lose data. } for (int i = 0; i &lt; size; i++) { // go through and remove the minimum element int temp = queue.dequeue(); // mark the currently removed element if (temp == min) break; // if it's the minimum, stop we've removed it. queue.enqueue(temp); // otherwise put it back on. } stack.push(min); // put the minimum value on the stack (in sorted order) size--; // we have one less element to consider, so decrement the size. } </code></pre> <p>After the sort is over the elements will be sorted on the Stack, removing them all will return data in order Greatest to Least (which can easily be reversed).</p> <p>No this is not very efficient, i'm assuming it's a homework assignment. Realisticaly if you want to sort data you should use Arrays.sort or Collections.sort which implement a merge sort for objects and a quicksort for primitives. These will be far faster (O(NlogN) vs O(N*N)). Realize however you'll need to have data in an array or a list to do this, not a stack or queue.</p>
    singulars
    1. This table or related slice is empty.
    1. POSorting an array with Stacks and Queues
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USRobert Mitchell
    1. USRobert Mitchell
    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. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COThe method is supposed to take in an int[] list, which contains all the numbers. And then uses a Stack and Queue to sort it, which is unnecessary and pointless... EDIT: Also, I'm only limited to enqueue(), dequeue() and isEmpty() methods for the Queue, and push(), pop() and isEmpty() in the Stack.
      singulars
      1. PO
      1. USuser123
    2. COIn that case simply put every element from the int[] onto the Queue, then at the end put all the elements from the stack into the int[] in reverse order. I'll edit the code for your methods.
      singulars
      1. PO
      1. USRobert Mitchell
 

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