Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with sorting
Search options not deleted
user 32260
the algorithmic problem of ordering a set of elements with respect to some ordering relation.
6
votes
3
answers
1k
views
Complexity of sorting a 1-sorted array
The complexity of sorting such array is $O(n\log k)$. But if $k=1$, then $\log k=0$ so what happens? … What is the complexity of sorting an array where each element is at most one place away from its sorted position? …
- 63