[ http://issues.apache.org/jira/browse/STDCXX138?page=all ]
Martin Sebor updated STDCXX138:

Component: Tests
(was: 25. Algorithms)
Summary: algorithms complexity tests not strict enough (was: Complexity tests are not
strict enough for some algorithms when the expected complexity is a function of the given
sequence length (not exact count))
Abbreviated long subject line and assigned to the right component.
> algorithms complexity tests not strict enough
> 
>
> Key: STDCXX138
> URL: http://issues.apache.org/jira/browse/STDCXX138
> Project: C++ Standard Library
> Type: Improvement
> Components: Tests
> Versions: 4.1.3
> Environment: all
> Reporter: Anton Pevtsov
> Priority: Minor
> Fix For: 4.1.4
>
> 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.

This message is automatically generated by JIRA.

If you think it was sent incorrectly contact one of the administrators:
http://issues.apache.org/jira/secure/Administrators.jspa

For more information on JIRA, see:
http://www.atlassian.com/software/jira
