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 restricted-memory
Search options answers only
not deleted
user 32
For challenges with a restriction placed on the amount of memory that can be allocated. This can be through direct limits (e.g. 64 bytes) or through big-O-notation (e.g. O(n log(n))).
2
votes
Fastest way to sort a big array of Gaussian-distributed data
Here is another sequential solution. This one uses the fact that the elements are normal distributed, and the I think the idea is generally applicable to get sorting close to linear time.
The algorit …
- 6,130
8
votes
Fastest way to sort a big array of Gaussian-distributed data
Here is another sequential solution:
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <ctime>
typedef unsigned long long ull;
int size;
double *dbuf, *copy;
int cnt[8][1 << 16]; …
- 6,130