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 performance
Search options not deleted
user 31381
Performance is a subset of Optimization: performance is the goal when you want the execution time of your program or routine to be optimal.
0
votes
Fastest function to find cumulative largest perfect squares of a single number?
Since you are subtracting squares, your loop won't have to execute very many times. Every step shrinks the number of yards.
I originally thought you might want to optimize it for when there are multi …
- 435
6
votes
Accepted
Finding the largest of a series of numbers being XORed
What I ended up doing took at most 0.27s for trial #10. Since the maximum value is 32767, I just create an array with a structure that stores a list of indexes that have that value:
typedef struct { …
- 435