| Key: |
STDCXX-138
|
| Type: |
Improvement
|
| Status: |
Open
|
| Priority: |
Minor
|
| Assignee: |
Unassigned
|
| Reporter: |
Anton Pevtsov
|
| Votes: |
0
|
| Watchers: |
0
|
|
If you were logged in you would be able to see more operations.
|
|
|
|
Environment:
|
all
|
|
Issue Links:
|
Reference
|
|
|
|
This issue is related to:
|
|
STDCXX-397
std::sort introsort implementation error
|
|
|
|
|
|
|
Affects tests for sort, stable_sort, partial_sort, partial_sort_copy, nth_element, etc algorithms where the complexity is O(f(N)), where N is the length of the test sequence, f(N) - some function of N: log N, N log N, N.
It is necessary to investigate each algorithm to find the worst case for it and use the complexity on this worst sequence as the upper bound in tests. Currently "magic" coefficients are used.
|
|
Description
|
Affects tests for sort, stable_sort, partial_sort, partial_sort_copy, nth_element, etc algorithms where the complexity is O(f(N)), where N is the length of the test sequence, f(N) - some function of N: log N, N log N, N.
It is necessary to investigate each algorithm to find the worst case for it and use the complexity on this worst sequence as the upper bound in tests. Currently "magic" coefficients are used. |
Show » |
| No work has yet been logged on this issue.
|
|
algorithms complexity tests not strict enough
