Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Here are some links to sorting algorithms implemented in Haskell:</p> <ul> <li><a href="https://en.wikipedia.org/wiki/Quicksort" rel="nofollow noreferrer" title="Quicksort">Quicksort</a></li> <li><a href="https://en.wikipedia.org/wiki/Insertion_sort" rel="nofollow noreferrer" title="Insertion sort">Insertion sort</a></li> <li><a href="https://en.wikipedia.org/wiki/Merge_sort" rel="nofollow noreferrer" title="Merge sort">Merge sort</a></li> <li><a href="https://en.wikipedia.org/wiki/Selection_sort" rel="nofollow noreferrer" title="Selection sort">Selection sort</a></li> <li><a href="https://en.wikipedia.org/wiki/Counting_sort" rel="nofollow noreferrer" title="Counting sort">Counting sort</a></li> </ul> <p>Merge sort is often the best choice for sorting linked lists. Functional languages usually operates on lists although I have little knowledge on how most functional languages implements lists. In Common Lisp they are implemented as linked lists and I presume most functional languages do as well. </p> <p>While quicksort can be written for linked lists it will suffer from poor pivot selection because of random access. While this does not matter on completely random input, on partially or completely sorted input pivot selection becomes very important. Other sorting algorithms may also suffer from the slow random-access performance of linked lists. </p> <p>Merge sort on the other hand works well with linked lists and it is possible to implement the algorithm such that it only requires some constant of extra space with linked lists.</p>
    singulars
    1. This table or related slice is empty.
    1. POSorting in functional programming languages
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USNömmik
    1. USNömmik
    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. VTDownMod
    1. COYou should point out that one of these is head and shoulders better than all the others in a functional world: mergesort.
      singulars
      1. PO
      1. USEamon Nerbonne
    2. CO@Eamon, I have not heard before that merge sort is the algorithm to use for functional languages. However I have added some to explanation why that might be. If there is anything in particular you are referring to that I have not covered then I am curious!
      singulars
      1. PO
      1. USNömmik
 

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