-
I was playing with a different word list today and discovered that this does not always find the optimal solution. Using the word lists [guesslist.txt](https://github.com/user-attachments/files/173023…
-
I would like the ability to express size limits in my API based on the observed sizes of nested objects/arrays, rather than the worst case.
For example, consider an API like so (this is a real API …
-
http://bugzilla.xmos.local/show_bug.cgi?id=16234
**_Peter Hedinger 2014-12-12 14:10:40 GMT_**
The lib_ethernet/tests/test_4_1_4 is failing now that I enabled filler threads to stress the timing.
…
-
We need to decide on how we should resolve the following use-case, and update code & guidelines in accordance.
- What are our recommendations for mobile?
- To long tab titles making tabs go outside v…
-
Implement the worst case algorithm
-
The current algorithm implemented by @magarick in https://github.com/pola-rs/polars/pull/9277#issuecomment-1581401692 is quadratic in the worst case. Reproduction:
```python
bad = [i ^ 1 for i in…
orlp updated
2 months ago
-
It would seem "Domiter V. and Zalik B. (2008) Sweep‐line algorithm for constrained Delaunay triangulation" is locked off from public view. What is the worst-case time complexity of that algorithm?
-
Making the process lightweight is exciting, but also scary. Let's try to imagine how scary it could get.
-
The worst case behaviour of quick select is well-known to be quadratic. For a general-purpose module it would be better to use introselect for example, so we can guarantee decent (linear) worst case b…
-
```
Detect if we cannot reach a 7-letter word, and just bid the incremental value
of the current letter.
```
Original issue reported on code.google.com by `benwarfield@gmail.com` on 28 Nov 2009 at 6…