| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 22 matching lines...) Expand all Loading... |
| 33 delete numbers[25000]; | 33 delete numbers[25000]; |
| 34 delete numbers[n-1]; | 34 delete numbers[n-1]; |
| 35 delete numbers[n-2]; | 35 delete numbers[n-2]; |
| 36 delete numbers[30]; | 36 delete numbers[30]; |
| 37 delete numbers[2]; | 37 delete numbers[2]; |
| 38 delete numbers[1]; | 38 delete numbers[1]; |
| 39 delete numbers[0]; | 39 delete numbers[0]; |
| 40 numbers.sort(); | 40 numbers.sort(); |
| 41 } | 41 } |
| 42 | 42 |
| 43 testsort(100000) | 43 testsort(100000); |
| OLD | NEW |