3 ms·
That has exponential complexity, is network-bound (slow) and still doesn't handle many cases (for example a "current DOM" where all relative links and images ar
by dullgiulio 9y ago
That has exponential complexity, is network-bound (slow) and still doesn't handle many cases (for example a "current DOM" where all relative links and images are broken).
- bluepnume 9y agoShould be O(n) unless you're trying to optimize for every single permutation of query param, right? I'd assume the majority of the time the individual params would be independent from one another. Plus you'd only need to do it once in a while for any given base url and persist the result.
- labster 9y agoCompared to GGP's approach of having a human do it, this is still fast. Also not sure why you'd want to share a link to a page where all the images and links are broken in the first place.