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 theory
Search options questions only
not deleted
user 10326
Theoretical question deal with topics that do not generally have immediate practical uses. Please be careful when using this tag: your question may be more appropriate for the Computer Science Stack Exchange site.
1
vote
2
answers
185
views
Help on clarification of a formal statement concerning algorithms running time
I am reading the following in a book on algorithms (Cormen's to be specific):
That is, we are concerned with how the running time of an algorithm
increases with the size of the input in the li …
- 1,830
15
votes
5
answers
6k
views
Algorithm refresher. Why is heapsort an insort algorithm?
I can not see why the heapsort is considered an inplace sorting algorithm.
I mean an extra data structure populated with the elements of the array to be sorted i.e. a heap, is used to assist in the …
- 1,830
4
votes
3
answers
3k
views
Basic premise on counting sort. How is k related to to Big Oh?
I am reading (Cormen) on counting sort.
I understand the structure of the algorithm but the statement:
In practice, we usually use counting sort when we have k = O(n), in
which case the runnin …
- 1,830