This program helps users to sort lists by preference using a binary insertion sort. It assumes that if choice a > b and b > c, then a > c, which may not hold for some decision making processes. It has an average run time of log2(n!), where n is the number of elements in the list. It will attempt to estimate the user's progress as they sort the list.
Choose the best option: