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 108182
Performance is a subset of Optimization: performance is the goal when you want the execution time of your program or routine to be optimal.
6
votes
2
answers
934
views
Longest palindrome in an array
I am new to programming, and think this code could be improved upon. Any suggestions?
#include <stdio.h>
#define size 10
void main()
{
int i,j,ii,jj,arr[size]={1,2,4,2,1,1,2,1,1,2};
…
- 335