Databases
StackOverflow2013
Postsdbo
POCustom sorting algorithm needed
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POCustom sorting algorithm needed
    primarykey
    data
    text
    <p>I have a need for an unusual sorting algorithm which would be massively useful to a lot of people, but I would prefer to leave the specific application vague as I have not found particularly good solutions in my research and was wondering if folks here could bring new ideas to the table. This is a real-world sort, so it has some restrictions which are different from many algorithms. Here are the requirements.</p> <ul> <li>The lists to be sorted are of no uniform number of elements. </li> <li>The values by which elements are sorted are not directly observable. </li> <li>The comparison operation of two elements is expensive. </li> <li>You may run as many comparison operations as you wish in parallel as you wish with no increase in expense. </li> <li>Each element may only participate in one comparison operation at a time. </li> <li>The result of a comparison operation only gives greater than, less than, or equal. </li> <li>There is a probability that the comparison operation results in an incorrect value which is dynamic given the difference in the hidden values of the elements. </li> <li>We have no indication when the comparison gives an incorrect value. </li> <li>We may assume that the dynamic error rate of comparison is normally distributed.<br> Elements might intermittently be unavailable for comparison. </li> </ul> <p>So, shot in the dark, hoping for somebody with an itch. The general gist is that you want to find the best way to set up a set of parallel comparisons to reveal as much information about the proper sort order as possible. A good answer would be able to describe the probability of error after n groups of actions. I'm sure some folks will be able to figure out what is being sorted based on this information, but for those who can't, believe me, there are many, many people who would benefit from this algorithm.</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USJames A Mohler
    1. USelegua
    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
    1. VO
      singulars
      1. POCustom sorting algorithm needed
      1. USTreborbob
      1. VTFavorite
    2. VO
      singulars
      1. POCustom sorting algorithm needed
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POCustom sorting algorithm needed
      1. USJames A Mohler
      1. VTFavorite
    1. This table or related slice is empty.
 

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