diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-02-19 13:16:51 -0800 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-02-19 13:16:51 -0800 |
commit | 596bbbe6dc3f8311a5166269d651d50ec6b2dff8 (patch) | |
tree | bb8c164a318fba0ce751d7a2ca68c004b646ea78 /src/bool | |
parent | 9aab58f6013a2f7973ac8fd5ac017f4f71a82cef (diff) | |
download | abc-596bbbe6dc3f8311a5166269d651d50ec6b2dff8.tar.gz abc-596bbbe6dc3f8311a5166269d651d50ec6b2dff8.tar.bz2 abc-596bbbe6dc3f8311a5166269d651d50ec6b2dff8.zip |
Added QuickSort based on 3-way partitioning.
Diffstat (limited to 'src/bool')
-rw-r--r-- | src/bool/bdc/bdcSpfd.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/bool/bdc/bdcSpfd.c b/src/bool/bdc/bdcSpfd.c index 26eccac7..54217282 100644 --- a/src/bool/bdc/bdcSpfd.c +++ b/src/bool/bdc/bdcSpfd.c @@ -299,7 +299,7 @@ Bdc_SpfdPrint( pNode + i, 1, vLevels, Truth ); goto cleanup; } } - pPerm = Abc_SortCost( Vec_IntArray(vWeight), c ); + pPerm = Abc_MergeSortCost( Vec_IntArray(vWeight), c ); assert( Vec_IntEntry(vWeight, pPerm[0]) <= Vec_IntEntry(vWeight, pPerm[c-1]) ); printf( "Best SPFD = %d.\n", Vec_IntEntry(vWeight, pPerm[c-1]) ); |