Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>There are lots of ways to handle it... You can use arrays, via dynamic memory allocation, with realloc, if you feel brave enough to try.</p> <p>The standard implementation of qsort, though, needs each element to be a fixed length, which would mean having an array-of-pointers-to-strings.</p> <p>Implementing a linked list, though, should be easy, compared to using pointers to pointers.</p> <p>I think what you were told to do was not to save the strings as list; but <em>in</em> a linked list:</p> <pre><code>struct node { char *string; node *next; } </code></pre> <p>Then, all you have to do is, every time you read a string, add a new node into the list, in its ordered place. (Walk the list until the current string's length is greater than the string you just read.)</p> <p>The problem of words not being a fixed length is common, and it's usually handled by storing the world temporarily in a buffer, and then copying it into a proper length array (dynamically allocated, of course).</p> <p><strong>Edit:</strong></p> <p>In pseudo code:</p> <pre><code>array = malloc(sizeof(*char)) array_size = 1 array_count = 0 while (buffer = read != EOF): if(array_count == array_size) realloc(array, array_size * 2) array_count++ sring_temp = malloc(strlen(buffer)) array[array_count] = string_temp qsort(array, array_count, sizeof(*char), comparison) print array </code></pre> <p>Of course, that needs a TON of polishing. Remember that array is of type <code>char **array</code>, ie "A pointer to a pointer to char" (which you handle as an array of pointers); since you're passing pointers around, you can't just pass the buffer into the array.</p>
    singulars
    1. This table or related slice is empty.
    1. POSorting a list with qsort?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USTordek
    1. USTordek
    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. COI have a slight idea how to use realloc - I have my notes from a lecture. I initially intended to make the program with only dynamic arrays but a teacher told me its better to use lists for *something*. How do I make a buffer? Is a buffer just a larger part of memory, say, a 100 chars? They are going to give us assignments where a teacher would lean on a keyboard to see if have predicted what would happen :-).
      singulars
      1. PO
      1. USDimitar
    2. COYeah, a buffer is usually a fixed array large enough for "anything". The issue is in choosing a buffer large enough for anything to fit, yet small enough not t make it inefficient (but that's not that much of an issue when involving user input). If you _must_ sort the list only ater input is complete, you can still put the string in the list as you get them, and sort them up afterwards. But there's little point in using a linked list, then :P.
      singulars
      1. PO
      1. USTordek
 

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