|
In linear time, find the maximum sum of all possible contiguous subarrays
|
|
Oct-30-2021, 05:05 PM
(This post was last modified: Oct-30-2021, 05:05 PM by Gribouillis.)
deanhystad Wrote:"Very well" sounds like a synonym for "reasonable possibility".By generating a list every NANOsecond, it takes 40 TRILLION years to generate 2**100 lists. i>>> nanosec_per_trillion_year = 1e12 * 365.25 * 24 * 3600 * 1e9 >>> 2**100 / nanosec_per_trillion_year 40.16942353753864That's more than 3000 times the estimated age of the universe, assuming it means something. |
|
|
| Possibly Related Threads… | |||||
| Thread | Author | Replies | Views | Last Post | |
| find the header location in a .bin file without reading the whole file at a time | SANJIB | 0 | 2,245 |
Mar-05-2021, 04:08 PM Last Post: SANJIB |
|
| Find frequencies of an audio file at a specific time via librosa | jberesford123__ | 0 | 2,361 |
Oct-21-2020, 01:18 PM Last Post: jberesford123__ |
|
| Find data using a period of time in SQLITE3 | SmukasPlays | 2 | 2,212 |
Jul-30-2020, 02:02 PM Last Post: SmukasPlays |
|
| Find if time is between start and end time | mikke3141 | 3 | 2,296 |
Jan-03-2020, 08:48 PM Last Post: mikke3141 |
|
| Find Maximum Flow for graph with infinite capacities | Dav | 6 | 4,295 |
Apr-16-2019, 02:08 PM Last Post: Dav |
|
