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 array
Search options not deleted
user 2495
A competition to solve a particular problem through the usage and manipulation of arrays.
2
votes
Rotate An Integer Array with an O(n) algorithm
C (137 characters)
#include <stdio.h>
void rotate(int * array, int n, int k) {
int todo = (1<<n+1)-1;
int i = 0, j;
int tmp = array[0];
while (todo) {
if (todo & 1<<i) { … j = (i-k+n)%n;
array[i] = todo & 1<<j ? …
- 121