PYTHON def _insertionsort(self, order): # Implements the insertion sort algorithm to sort a list of items in ascending or descending order n = len(self.items) for i in range(1, n): key = self.items[i] j = i - 1 if order == 'asc': while j >= 0 and key < self.items[j]: self.items[j + 1] = self.items[j] j -= 1 self.items[j + 1] = key elif order == 'desc': while j >= 0 and key > self.items[j]: self.items[j + 1] = self.items[j] j -= 1 self.items[j + 1] = key def sort(self, order = 'asc', type = 'insertion'): if type == 'insertion': # call the insertions sort method to sort atos array based on the parameter values #######################################################################
PYTHON
def _insertionsort(self, order):
# Implements the insertion sort
n = len(self.items)
for i in range(1, n):
key = self.items[i]
j = i - 1
if order == 'asc':
while j >= 0 and key < self.items[j]:
self.items[j + 1] = self.items[j]
j -= 1
self.items[j + 1] = key
elif order == 'desc':
while j >= 0 and key > self.items[j]:
self.items[j + 1] = self.items[j]
j -= 1
self.items[j + 1] = key
def sort(self, order = 'asc', type = 'insertion'):
if type == 'insertion':
# call the insertions sort method to sort atos array based on the parameter values
#######################################################################
Step by step
Solved in 4 steps with 2 images
