Now showing items 1-2 of 2

    • Finding Repeated Elements 

      Misra, Jayadev; Gries, David (Cornell University, 1982-07)
      Two algorithms are presented for finding the values that occur more than $n \div k$ times in array b[O:n-1]. The second algorithm requires time $O(n \log(k))$ and extra space $O(k)$. We prove that $O(n \log(k))$ is a ...
    • A Linear Sieve Algorithm for Finding Prime Numbers 

      Gries, David; Misra, Jayadev (Cornell University, 1977-06)