def main():
    args = get_args()
    np.random.seed(args.seed)
    if args.test:
        test_algorithm(args.seed, numTrials=args.trial, numVals=args.vals, verbose=args.verb)
        return
    values = get_list(args)
    findVal = (args.small if (args.small != None) else (len(values) // 2))
    print('\n')
    print('   --   Prune and Search Algorithm   --   ')
    print('     ================================     ')
    print('      Find The {}-Smallest Value          '.format(findVal))
    print('      In The List =                   ')
    elPerRow = 5
    for idx in range(0, len(values), elPerRow):
        print('                   ', *values[idx:(idx + elPerRow)])
    print('\n')
    print('Beginning Sort And Search   . . .  ', end='', flush=True)
    startTime = time.time()
    ansVal_A = algs.SortAndSearch(values, findVal)
    endTime = time.time()
    print('Δ : {:.6f}'.format((endTime - startTime)))
    print('Beginning Prune And Search  . . .  ', end='', flush=True)
    startTime = time.time()
    ansVal_B = algs.PruneAndSearch(values, findVal)
    endTime = time.time()
    print('Δ : {:.6f}'.format((endTime - startTime)))
    print('\nDid the Algorithms find the same solutions? ==> {}\n'.format((ansVal_A == ansVal_B)))
    print('The {}-Smallest Value is {}'.format(findVal, ansVal_A))
    return
def main():
    args = get_args()
    np.random.seed(args.seed)
    if args.test:
        test_algorithm(args.seed, numTrials=args.trial, numVals=args.vals, verbose=args.verb)
        return
    values = get_list(args)
    findVal = (args.small if (args.small != None) else (len(values) // 2))
    print('\n')
    print('   --   Prune and Search Algorithm   --   ')
    print('     ================================     ')
    print('      Find The {}-Smallest Value          '.format(findVal))
    print('      In The List =                   ')
    elPerRow = 5
    for idx in range(0, len(values), elPerRow):
        print('                   ', *values[idx:(idx + elPerRow)])
    print('\n')
    print('Beginning Sort And Search   . . .  ', end=, flush=True)
    startTime = time.time()
    ansVal_A = algs.SortAndSearch(values, findVal)
    endTime = time.time()
    print('Δ : {:.6f}'.format((endTime - startTime)))
    print('Beginning Prune And Search  . . .  ', end=, flush=True)
    startTime = time.time()
    ansVal_B = algs.PruneAndSearch(values, findVal)
    endTime = time.time()
    print('Δ : {:.6f}'.format((endTime - startTime)))
    print('\nDid the Algorithms find the same solutions? ==> {}\n'.format((ansVal_A == ansVal_B)))
    print('The {}-Smallest Value is {}'.format(findVal, ansVal_A))
    return