Memory usage of code is O(N^3/p)
So getting it to fit in RAM as N goes up requires increasing p. At which point the index table stops fitting in RAM. Guess I have to implement binary search now :(
Memory usage of code is O(N^3/p)
So getting it to fit in RAM as N goes up requires increasing p. At which point the index table stops fitting in RAM. Guess I have to implement binary search now :(
A few minutes later I discovered that Nuutti Kuosa had found this in 2006, presumably using much less compute :(
A few minutes later I discovered that Nuutti Kuosa had found this in 2006, presumably using much less compute :(
www.instagram.com/reel/DTmAnJx...
www.instagram.com/reel/DTmAnJx...