David R. MacIver DRMacIver

## maj.py
# Naive majority judgement implementation. Bigger numbers are better.

def majority_ranking(a):
    a = sorted(a)

    while a:
      x = a[len(a) / 2]
      del a[len(a) / 2]
      yield x
	# Naive majority judgement implementation. Bigger numbers are better.

	def majority_ranking(a):
	a = sorted(a)

	while a:
	x = a[len(a) / 2]
	del a[len(a) / 2]
	yield x