Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Keep your lined list objects in the lined list, in random order. To sort the list by any key, use this pseudocode:</p> <pre><code>struct LinkedList { string name; LinkedList *prev; LinkedList *next; }; void FillArray(LinkedList *first, LinkedList **output, size_t &amp;size) { //function creates an array of pointers to every LinkedList object LinedList *now; size_t i; //you may use int instead of size_t //check, how many objects are there in linked list now=first; while(now!=NULL) { size++; now=now-&gt;next; } //if linked list is empty if (size==0) { *output=NULL; return; } //create the array; *output = new LinkedList[size]; //fill the array i=0; now=first; while(now!=NULL) { *output[i++]=now; now=now-&gt;next; } } SortByName(LinkedList *arrayOfPointers, size_t size) { // your function to sort by name here } void TemporatorySort(LinkedList *first, LinkedList **output, size_t &amp;size) { // this function will create the array of pointer to your linked list, // sort this array, and return the sorted array. However, the linked // list will stay as it is. It's good for example when your lined list // is sorted by ID, but you need to print it sorted by names only once. FillArray(first, *output, size); SortByName(output,size); } void PermanentSort(LinkedList *first) { // This function will sort the linked list and save the new order // permanently. LinkedList *sorted; size_t size; TemporatorySort(first,&amp;sorted,size); if (size&gt;0) { sorted[0].prev=NULL; } for(int i=1;i&lt;size;i++) { sorted[i-1].next=sorted[i]; sorted[i].prev=sorted[i-1]; } sorted[size-1].next=NULL; } </code></pre> <p>I hope, I actually did help you. If you don't understand any line from the code, simply put a comment to this "answer".</p>
    singulars
    1. This table or related slice is empty.
    1. POdoubly linked list implementation
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USArtur Iwan
    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. This table or related slice is empty.
    1. COthis is a good example but i'm required to do sorting and searching using the linked list(which i think is very inefficient)
      singulars
      1. PO
      1. USHorace Heaven
    2. CO@Horace Heaven: It is possible to implement QuickSort right onto the Linked List. But I don't have the code now, and it will take at least 30-60 minutes for me to write it... I don't have so much time.
      singulars
      1. PO
      1. USArtur Iwan
    3. CO@Horace Heaven: One more thing: The code I wrote IS for sorting a linked list :) but at first, it will load the list into an array of pointers (`FillArray` function), sort that array and return the sorted array only (`TemporatorySort` function). But it can also take the whole linked list, sort it and leave it sorted (`PermanentlySort` function).
      singulars
      1. PO
      1. USArtur Iwan
 

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