Given an array $$$a=[a_1,\,a_2,\,a_3,...,\,a_n]$$$ and a fixed windows size $$$k$$$,define sliding window $$$I_{j,\,(j \geq k)} := [a_{j-k+1}, a_{j-k+2}, ..., a_j]$$$.
Sorting sliding windows online
Given an array $$$a=[a_1,\,a_2,\,a_3,...,\,a_n]$$$ and a fixed windows size $$$k$$$,define sliding window $$$I_{j,\,(j \geq k)} := [a_{j-k+1}, a_{j-k+2}, ..., a_j]$$$.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en15 |
|
div4only | 2023-02-08 10:36:54 | 0 | (published) | |
| en14 |
|
div4only | 2023-02-08 10:36:46 | 1 | Tiny change: 'unded data stream ins' -> 'unded datastream ins' (saved to drafts) | |
| en13 |
|
div4only | 2023-02-08 10:36:35 | 8 | Tiny change: 'j$ before $a_{j+1}$' -> 'j$ before reading $a_{j+1}$' | |
| en12 |
|
div4only | 2023-02-08 09:55:46 | 4 | Tiny change: 'Given an 1-index integer a' -> 'Given an $1$-indexed integer a' | |
| en11 |
|
div4only | 2023-02-08 09:51:24 | 18 | Tiny change: 'to answer the following queries:\n\nHow m' -> 'to answer a query:\n\nHow m' | |
| en10 |
|
div4only | 2023-02-08 09:40:41 | 0 | (published) | |
| en9 |
|
div4only | 2023-02-08 09:40:28 | 22 | (saved to drafts) | |
| en8 |
|
div4only | 2023-02-08 09:35:26 | 0 | (published) | |
| en7 |
|
div4only | 2023-02-08 09:35:02 | 4 | Tiny change: 'owing query:\n\nHow m' -> 'owing queries:\n\nHow m' (saved to drafts) | |
| en6 |
|
div4only | 2023-02-08 09:34:38 | 0 | (published) | |
| en5 |
|
div4only | 2023-02-08 09:34:12 | 507 | ||
| en4 |
|
div4only | 2023-02-08 09:29:31 | 182 | ||
| en3 |
|
div4only | 2023-02-08 09:27:35 | 1 | Tiny change: ' ..., a_j]. ' -> ' ..., a_j]$. ' | |
| en2 |
|
div4only | 2023-02-08 09:27:23 | 109 | ||
| en1 |
|
div4only | 2023-02-08 06:08:51 | 76 | Initial revision (saved to drafts) |