A B C D E A B C F A C. D F. A. B. C. D. E. F.

Size: px

Start display at page:

Download "A B C D E A B C F A C. D F. A. B. C. D. E. F."

袜咸
7 years ago
Views:

1 A B A C D B E F A, B. C, D. E, F. A. B. C. D. E. F.

2 A B C D E A B C F A C. D F. A. B. C. D. E. F.

3 40 60 A 0% B GB C D E A. B. C E. A. B. C. D. E. 70%

4 GB A B C D E F G H I A D. E I. A. B. C. D. E. F. G. H. I. A B () () () (4) (5) 5 L (a c e) L (a b d) L (a b e) L 4 (a c d) ace abd abe acd A B C D E F G H I A. I. (,0,4) (,0,) ace (,,) (,,) abd 4

5 (,0,) (,0,4) abe (,,) (,,) abe (,0,4) (,0,) ace (,,) (,,) abe (,0,) (,,) acd (,0,4) (,0,) ace (,0,) (,0,) abd (,,) (,,) abe (,0,4) (,0,) ace (,,) (,,) abd (,,) (,,) abe (,0,) (,0,) acd (,0,4) (,0,) ace (,,) (,,) abd (,0,) (,0,4) abe (,,) (,,) A. B. C. D. E. F. G. H. I. B C D E F G () L L A, B, x A, B, (, 0, 4) (, 0, ) ace L 4 () L L (, 0, 4) (, 0, ) ace L (,, ) (,, ) abd L L L4 : (,, ) (,, ) abe L (, 0, ) (,, ) acd L4 x x () A T 5

6 B 0 T A T x T4 T4 (, 0, 4) (, 0, ) (, 0, ) (, 0, ) (,, ) (,, ) ace (L) abd (L) abe (L) T T T T4 T T T T4 T T T T4 (, 0, ) (, 0, 4) abe (L) T T T T4 b,e (,, ) (,, ) abe (L) T T T T4 b,e (4) T T T T4 T T T T4 8 4 (, 0, 4) (, 0, ) ace (L) T T T T4 c,e (,, ) (,, ) abd (L) T T T T4 b,d (A and B 0 B 0 A B 0 B 0 A or X A X (5) A,B 0 T T A,B 0 T T A,B 0 T T A,B 0 T T A,x T T4 A,x T T4 A,x T T4 A,x T T4 c,e b,d b,e 6

7 (, 0, 4) (, 0, ) ace (L) T T T T4, (,, ) (,, ) abe (L) T T T T4, (, 0, ) (, 0, 4) abe (L) T T T T4, (,, ) (,, ) abd (L) T T T T4, L4 (6) (, 0, 4) (, 0, ) ace (L) T T T T4 (,, ) (,, ) abd (L) T T T T4 (,, ) (,, ) abe (L) T T T T4 (, 0, ) (, 0, ) acd (L4) T T T T4 6 datalist Element V n V[i] getkey ( ) Swap( int Partition ( datalist &list, int low, int high ) { // [ low, high ] k int k = low; Element pivot = list.v[low]; // for ( int i = low+; i <= high; i++ ) // if ( list.v[i].getkey ( ) < pivot.getkey( ) && ++ k!= i ) Swap ( list.v[k], list.v[i] ); // Swap ( list.v[low], list.v[k] ); // return k; // } () () 0 k=low; pivot=v[low]; i=low+; i high? F T V[i] < pivot && ++k i T F V[low] V[k]; return k 7

8 V[k] V[i]; i++; () low high k i V[0] V[] V[] k i V[0] V[] V[] i high 0 low = high low + = high low+ = BRO V[i] < pivot && ++k i { (<, < ), (<, = ), (=, <), (>, < ) } low high k i V[0] V[] V[] pivot k i V[0] V[] V[] (>, <) 0 0 (<, =) (=, <) 0 0 (<, <) (>, <) (>, <) (>, <) (=, <) (>, <) (<, <) 0 0 (>, <) (<, =) 0 0 (<, =) (<, =) 8

9 0 0 (<, =) (=, <) 0 0 (<, =) (>, <) 0 0 (<, =) (<, <) (=, <) (>, <) (=, <) (<, <) (=, <) (=, <) 0 0 (=, <) (<, =) 0 0 (<, <) (*, *) 5- ( ) A B C D E A. B. C. D. E. 5- A B C D E A. B. 9

10 C. D. E. 5-5 () () () (4) n n (5) (6) GOTO GOTO (7) (8) (9) (0) 5-4 () () () (4) (5) A E A B C D E F G H I J A, C B, D 0

11 E, F, G, H / I J 5-8 ( ) A B B C D E E A B C ~ E 5-9 datalist Element V n V[i] getkey ( ) Swap( void SelectSort ( datalist & list ) { // list.v[0] list.v[n-], n for ( int i = 0; i < list.n-; i++ ) { int k = i; // list.v[i].key list.v[n-].key for ( int j = i+; j < list.n; j++) if ( list.v[j].getkey ( ) < list.v[k].getkey ( ) ) k = j; if ( k!= i ) Swap ( list.v[i], list.v[k] ); // // } } () McCabe () () () () 5-00,000, 0; 60, 00,, MTTF = , 00,, MTTF = () ;

12 () MTTF 0,? () MTTF t 5-

第三节软件测试的过程与策略

第三节软件测试的过程与策略 ...1...4...9...17...25...29...34...40...46...55...65...73 1 2 3 4 5 6 7 8 9 10 11 1 12 13 1 ABCD 2 A B C D 3 ABCD 4 A1/2 B1/3 C1/4 D2/3 5 % A20 B30 C40 D50 6 A B C D 7 A B C D / 8 A B C D 9 A B C D 10