Created
August 26, 2012 08:06
-
-
Save smallgeek/3476004 to your computer and use it in GitHub Desktop.
NaturalSpec_Tutorial_6_4
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Scenario: When sorting empty list | |
| - Given [] | |
| – When sorting with QuickSort | |
| => It should be sorted | |
| => It should contain all elements from [] | |
| => It should contain no other elements than [] | |
| ==> Result is: [] | |
| ==> OK | |
| ==> Time: 0.0355s | |
| Scenario: When sorting small list | |
| - Given [2; 1; 8; 15; 5; 22] | |
| – When sorting with QuickSort | |
| => It should be sorted | |
| => It should contain all elements from [2; 1; 8; 15; 5; 22] | |
| => It should contain no other elements than [2; 1; 8; 15; 5; 22] | |
| ==> Result is: [1; 2; 5; 8; 15; 22] | |
| ==> OK | |
| ==> Time: 0.0065s | |
| Scenario: When sorting ordered list | |
| […] 100 elements | |
| ==> OK | |
| ==> Time: 0.0939s | |
| Scenario: When sorting ordered list | |
| […] 1000 elements | |
| ==> OK | |
| ==> Time: 0.7130s | |
| Scenario: When sorting ordered list | |
| […] 2500 elements | |
| ==> OK | |
| ==> Time: 3.0631s | |
| Scenario: When sorting random list | |
| […] 100 elements | |
| ==> OK | |
| ==> Time: 0.0485s | |
| Scenario: When sorting random list | |
| […] 1000 elements | |
| ==> OK | |
| ==> Time: 0.1878s | |
| Scenario: When sorting random list | |
| […] 1000 elements | |
| ==> OK | |
| ==> Time: 0.8713s |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment