-
@kalashsinghal let's discuss in tomorrow's sprint
-
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…
-
Discussed in the site chat this morning:
> Can anyone please tell me what is wrong with the following. Trying to place tile 24 on B25 in game https://18xx.games/game/151565
>
> it does let me whe…
-
- when multiple windows are opened and command mode is enabled on the first app, disable commander mode on the second app
- what happens to shortcuts?
-
## Motivation
the S3-FIFO and SIEVE both have O(N) of worst-case time-complexity.
There are many discussion around here to improve this.
refer. https://discuss.systems/@tobinbaker/111660148137611…
-
Honour
Medium
# `RedstoneOracle` priceTimestamp can be acurately determined , eliminating the need for a -3 mins worst case scenario
### Summary
`RedstoneOracle` sets the `priceTimestamp` of a pri…
-
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?
-
I tested on a dataset with 1442910 words.
```rust
#[test]
fn test_worse_case() -> Result {
let case = "bring more land under cultivation";
let conf = crate::config::get_config();
l…
-
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…