If you sort two bits and get 0, 1 you can't know if you started out with 0, 1 or 1, 0. The entropy of a sorted list of bit is O(log(n)) while the entropy of th

If you sort two bits and get 0, 1 you can't know if you started out with 0, 1 or 1, 0. The entropy of a sorted list of bit is O(log(n)) while the entropy of the unsorted bits is O(n).