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 sorting
Search options not deleted
user 92490
the algorithmic problem of ordering a set of elements with respect to some ordering relation.
2
votes
1
answer
85
views
Dijkstra Partitioning Algorithm : Special Case
Below is my algorithm:
while (i < j)
{
case a[i]:
R : i++;
W : j--; swap(a[i], a[j]);
B : j--; k--; swap(a[i], a[k]); swap(a[i], a[j]);
end case
}
//Done Sorting …
- 215
2
votes
1
answer
159
views
Algorithm Analysis of Insertion Sort
Why is the recurrence formula for insertion sort is T(n-1) + n?
I understand the T(n-1) part but the why does the cost for merging results is n or linear. Do we have to merge in insertion sort?
- 215
1
vote
0
answers
56
views
Recurrence Formula for Bitonic Sorter Runtime
A Bitonic sorter takes a bitonic sequence as an input and the output is a sorted list. I want to analyse Bitonic Sorter by knowing its depth/runtime. Can anyone give an idea on its recurreence formula …
- 215