Timeline for How does size of a number in an array affect time complexity algorithm analysis?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2017 at 13:51 | comment | added | hi.nitish | @D.W. i expect your reply since you downvoted. :-p | |
| Aug 8, 2017 at 9:08 | comment | added | hi.nitish | @D.W. While calculating for rolling hash, suppose for pattern problem finding problem in a big matrix, the working is simply subtracting the last nth digit multiplied by 1000000 for seven digits pattern and adding the next digit looks simple operation but may take huge time if the hash takes many words of 32bits. To follow carry operations overhead like bits, 2's complement, the result takes time. So modP is multiplied to constrain it to one word. Hope it presents rolling hash issue as one example to see the the time complexity issue due to operations of bits in words. | |
| Aug 7, 2017 at 20:24 | comment | added | D.W.♦ | It's not clear what this has to do with the question. Can you edit your answer to clarify the connection to the question? | |
| Aug 7, 2017 at 10:53 | review | First posts | |||
| Aug 7, 2017 at 11:09 | |||||
| Aug 7, 2017 at 10:50 | history | answered | hi.nitish | CC BY-SA 3.0 |