Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal
import random def is_sorted(l): for x in range(lengthlen(l)-1): if l[x] > l[x+1]: return False return True def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffle(l) while not is_sorted(l): i, j = index_chooser(length) assert (i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1 return steps import random def is_sorted(l): for x in range(length-1): if l[x] > l[x+1]: return False return True def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffle(l) while not is_sorted(l): i, j = index_chooser(length) assert (i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1 return steps import random def is_sorted(l): for x in range(len(l)-1): if l[x] > l[x+1]: return False return True def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffle(l) while not is_sorted(l): i, j = index_chooser(length) assert (i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1 return steps 
import random def is_sorted(l): for x in range(length-1): if l[x] > l[x+1]: return False return True def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffle(l) while not is_sorted(l): i, j = index_chooser(length) assert (i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1 return steps import random def is_sorted(l): for x in range(length-1): if l[x] > l[x+1]: return False return True def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffle(l) while not is_sorted(l): i, j = index_chooser(length) assert(i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1 import random def is_sorted(l): for x in range(length-1): if l[x] > l[x+1]: return False return True def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffle(l) while not is_sorted(l): i, j = index_chooser(length) assert (i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1 return steps 
import random def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffleis_sorted(l) while True: for x in range(length-1): if l[x] > l[x+1]: return False break return True def score(length, index_chooser): steps = else:0 l = list(range(length)) random.shuffle(l) return steps while not is_sorted(l): i, j = index_chooser(length) assert(i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1 import random def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffle(l) while True: for x in range(length-1): if l[x] > l[x+1]: break else: return steps i, j = index_chooser(length) assert(i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1 import random def is_sorted(l): for x in range(length-1): if l[x] > l[x+1]: return False return True def score(length, index_chooser): steps = 0 l = list(range(length)) random.shuffle(l) while not is_sorted(l): i, j = index_chooser(length) assert(i < j) if l[i] > l[j]: l[i], l[j] = l[j], l[i] steps += 1