TRS_07170的博客

MergeSort def merge(numbers, i, j, k): merged_size = k - i + 1 # Size of merged partition merged_numbers = [0] * merged_size # Dynamically allocates temporary array # for merged numbers

Quicksort def partition(numbers, start_index, end_index): # Select the middle value as the pivot. midpoint = start_index + (end_index - start_index) // 2 pivot = numbers[midpoint] # "low" and "high" start at the ends of the list segme

Heaps class MaxHeap: def __init__(self): self.heap_array = [] def percolate_up(self, node_index): while node_index > 0: # compute the parent node's index parent_index = (node_index - 1) // 2

AVL Tree class Node: # Constructor with a key parameter creates the Node object. def __init__(self, key): self.key = key self.parent = None self.left = None self.right = None self.height = 0 #

Binary Search Tree class Node: # Constructor assigns the given key, with left and right # children assigned with None. def __init__(self, key): self.key = key self.left = None self.right = None class BinarySearchTree