diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-07-07 17:46:54 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-07-07 17:46:54 -0700 |
| commit | 3aab7245738a69f1dd4d898493d5dabf6596ea61 (patch) | |
| tree | 16a23107ca27a250e82c492dcdd1a2bea640cff6 /src/misc/util/utilSort.c | |
| parent | 16d96fcf533fb77ff4a45992991e38ac7ea74bb3 (diff) | |
| download | abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.tar.gz abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.tar.bz2 abc-3aab7245738a69f1dd4d898493d5dabf6596ea61.zip | |
Fixing time primtouts throughout the code.
Diffstat (limited to 'src/misc/util/utilSort.c')
| -rw-r--r-- | src/misc/util/utilSort.c | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/src/misc/util/utilSort.c b/src/misc/util/utilSort.c index eb2b32c3..48321c9f 100644 --- a/src/misc/util/utilSort.c +++ b/src/misc/util/utilSort.c @@ -398,9 +398,10 @@ int Abc_SortNumCompare( int * pNum1, int * pNum2 ) void Abc_SortTest() { int fUseNew = 0; - int i, clk, nSize = 50000000; + int i, nSize = 50000000; int * pArray = (int *)malloc( sizeof(int) * nSize ); int * pPerm; + clock_t clk; // generate numbers srand( 1000 ); for ( i = 0; i < nSize; i++ ) @@ -743,7 +744,8 @@ void Abc_QuickSortTest() int nSize = 1000000; int fVerbose = 0; word * pData1, * pData2; - int i, clk = clock(); + int i; + clock_t clk = clock(); // generate numbers pData1 = ABC_ALLOC( word, nSize ); pData2 = ABC_ALLOC( word, nSize ); |