Timeline for Algorithm to find approximate position of element from a noisy sorted list
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 18, 2023 at 11:30 | comment | added | nehem | I'm literally trying to do what the title says, Algorithm to find approximate position of element from a noisy(nearly) sorted list | |
| Dec 17, 2023 at 21:24 | comment | added | nosyarg | I am still trying to determine what precisely you are trying to do. Does this mean you have several lists which have slightly different orders, a comparison query is only correct with some probability, or something else? | |
| Dec 16, 2023 at 12:31 | comment | added | nehem | In practice there is no definite way to sort the list, i.e there are more ways to sort the list. It's like ranking celebrities. Many different magazine organisations will come up with their own list which somewhat agrees with each other but not exactly agree with each others. | |
| Dec 13, 2023 at 17:33 | comment | added | nosyarg | It would be difficult to write an algorithm for this without some sort of precise definition of the problem. Certainly it seems like some relaxation of binary search would work, but in order to figure out exactly what relaxation would work, we would need to know what form the noise takes and how tolerant you are of error. | |
| Sep 14, 2021 at 7:57 | history | edited | nehem | CC BY-SA 4.0 |
added 12 characters in body
|
| Sep 14, 2021 at 7:51 | history | edited | nehem | CC BY-SA 4.0 |
added 28 characters in body
|
| Sep 14, 2021 at 7:06 | answer | added | Inuyasha Yagami | timeline score: 1 | |
| S Sep 14, 2021 at 6:51 | review | First questions | |||
| Sep 24, 2021 at 7:11 | |||||
| S Sep 14, 2021 at 6:51 | history | asked | nehem | CC BY-SA 4.0 |