Talk:Marzullo's algorithm
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Removal
[edit]True or false: RickK knows how to get this article's link off of the Recent Changes header. 66.245.70.19 22:51, 3 Jul 2004 (UTC)
Method
[edit]I added some more information on what this algorithm does. I had to leave the method section pretty blank because I don't yet understand the algorithm (and I'm still looking for a good description of it online). Some of the links are in red still, I also need to examine them. RJFJR 01:36, 7 Dec 2004 (UTC)
Symbol substitute
[edit]Is there a symbol for plus-or-minus better than +/- ? RJFJR 01:37, 7 Dec 2004 (UTC)
There is ± from Plus–minus_sign in Unicode. — Preceding unsigned comment added by 96.19.209.222 (talk) 12:18, 11 March 2023 (UTC)
Additional parameter
[edit]I was pointed to this entry by a student of mine. Leslie Lamport coined the term Marzullo's algorithm.
It's usually expressed with an additional parameter - the maximum number of estimates that can be correct - since without such a parameter it's hard to say what it computes. You can think of it as a generalization of a Von Neumann voter (think triple module redundancy) where the values are intervals rather than points. User:KeithMarzullo (talk | contribs) 14:20, 25 February 2006 (UTC)
Time Complexity of Sorting Algorithm
[edit]Isn't the complexity of sorting an integer is O(n). If I understand it, NTP uses fixed precision number for time, hence the offset can be sorted as if it is integer. — Preceding unsigned comment added by 203.114.225.229 (talk) 11:09, 4 October 2018 (UTC)