3 ms·

I have an O(N) algorithm for factoring any prime: Read each digit of the prime from the input tape and write it to the output tape. :P (Perhaps you meant facto

by nullc 7y ago

I have an O(N) algorithm for factoring any prime: Read each digit of the prime from the input tape and write it to the output tape. :P (Perhaps you meant factoring large semi-primes? :) )

hoseja 7y ago
I have an O(1) then!
- ColinWright 7y ago
  Given that you have to read and then write each digit of the input I find it hard to believe that you have an O(1) algorithm - can you tell us what it is?
  - Yajirobe 7y ago
    Take a photo of the input on the tape and print the photo.
    - mratsim 7y ago
      Depending of the size of the prime you might need to take multiple photos.
  - hoseja 7y ago
    Print "1", thought that would be obvious...