|
1 | | -logger._print( 'original array = [' + D.join(', ') + ']' ); |
| 1 | +logger._print('original array = [' + D.join(', ') + ']'); |
2 | 2 | var N = D.length; |
3 | 3 | var writes = 0; |
4 | 4 | var pos; |
5 | 5 | var item; |
6 | 6 | var temp; |
7 | | -for( var cycleStart=0; cycleStart<=N-2; cycleStart++ ){ |
8 | | - item = D[cycleStart]; |
9 | | - pos = cycleStart; |
10 | | - for( var i=cycleStart+1; i<=N-1; i++ ){ |
11 | | - if( D[i]<item ){ |
12 | | - pos++; |
13 | | - } |
14 | | - } |
15 | | - if( pos == cycleStart ){ |
16 | | - continue; |
17 | | - } |
18 | | - while( item == D[pos] ){ |
19 | | - pos++; |
20 | | - } |
21 | | - temp = D[pos]; |
22 | | - D[pos] = item; |
23 | | - item = temp; |
| 7 | +for (var cycleStart = 0; cycleStart <= N - 2; cycleStart++) { |
| 8 | + item = D[cycleStart]; |
| 9 | + pos = cycleStart; |
| 10 | + tracer._select(cycleStart); |
24 | 11 |
|
25 | | - logger._print( 'Rewrite '+D[pos]+' to index '+pos ); |
| 12 | + for (var i = cycleStart + 1; i <= N - 1; i++) { |
| 13 | + tracer._select(i)._wait()._deselect(i); |
| 14 | + if (D[i] < item) { |
| 15 | + pos++; |
| 16 | + } |
| 17 | + } |
| 18 | + if (pos == cycleStart) { |
| 19 | + tracer._deselect(cycleStart); |
| 20 | + continue; |
| 21 | + } |
| 22 | + while (item == D[pos]) { |
| 23 | + pos++; |
| 24 | + } |
26 | 25 |
|
27 | | - tracer._notify(pos, D[pos])._notify(cycleStart, D[cycleStart])._wait(); |
28 | | - tracer._denotify(pos)._denotify(pos); |
| 26 | + temp = D[pos]; |
| 27 | + D[pos] = item; |
| 28 | + item = temp; |
29 | 29 |
|
| 30 | + if (pos !== cycleStart) { |
| 31 | + logger._print('Rewrite ' + D[pos] + ' to index ' + pos + '; the next value to rewrite is ' + item); |
| 32 | + } else { |
| 33 | + logger._print('Rewrite ' + D[pos] + ' to index ' + pos); |
| 34 | + } |
| 35 | + tracer._select(pos)._wait()._deselect(pos); |
| 36 | + tracer._notify(pos, D[pos])._notify(cycleStart, D[cycleStart])._wait(); |
| 37 | + tracer._denotify(pos)._denotify(cycleStart); |
30 | 38 |
|
31 | | - while( pos != cycleStart ){ |
32 | | - pos = cycleStart; |
33 | | - for( i=cycleStart+1; i<=N-1; i++ ){ |
34 | | - if( D[i]<item ){ |
35 | | - pos++; |
36 | | - } |
37 | | - } |
| 39 | + while (pos != cycleStart) { |
| 40 | + pos = cycleStart; |
38 | 41 |
|
39 | | - while( item == D[pos] ){ |
40 | | - pos++; |
41 | | - } |
42 | | - temp = D[pos]; |
43 | | - D[pos] = item; |
44 | | - item = temp; |
| 42 | + for (i = cycleStart + 1; i <= N - 1; i++) { |
| 43 | + tracer._select(i)._wait()._deselect(i); |
| 44 | + if (D[i] < item) { |
| 45 | + pos++; |
| 46 | + } |
| 47 | + } |
45 | 48 |
|
46 | | - logger._print( 'Rewrite '+D[pos]+' to index '+pos ); |
| 49 | + while (item == D[pos]) { |
| 50 | + pos++; |
| 51 | + } |
47 | 52 |
|
48 | | - tracer._notify(pos, D[pos])._notify(cycleStart, D[cycleStart])._wait(); |
49 | | - tracer._denotify(pos)._denotify(pos); |
| 53 | + temp = D[pos]; |
| 54 | + D[pos] = item; |
| 55 | + item = temp; |
50 | 56 |
|
51 | | - writes++; |
| 57 | + if (pos !== cycleStart) { |
| 58 | + logger._print('Rewrite ' + D[pos] + ' to index ' + pos + '; the next value to rewrite is ' + item); |
| 59 | + } else { |
| 60 | + logger._print('Rewrite ' + D[pos] + ' to index ' + pos); |
52 | 61 | } |
| 62 | + tracer._select(pos)._wait()._deselect(pos); |
| 63 | + tracer._notify(pos, D[pos])._notify(cycleStart, D[cycleStart])._wait(); |
| 64 | + tracer._denotify(pos)._denotify(cycleStart); |
53 | 65 |
|
54 | 66 | writes++; |
| 67 | + } |
| 68 | + |
| 69 | + writes++; |
55 | 70 | } |
56 | 71 |
|
57 | | -logger._print( 'Number of writes performed is ' + writes ); |
| 72 | +logger._print('Number of writes performed is ' + writes); |
0 commit comments