ayulockin

class LinkedStack:
    def __init__(self):
        self._head = None
        self._size = 0

    class _node:
        __slots__ = '_element', '_nextP'

        def __init__(self, element, nextP):
            self._element = element

ayulockin

def quicksort(S):

    if len(S)<2:
        print("[RETURNED]length of list less than 2")
        return
    
    pivot = S[-1]
    print("[INFO] pivot: ", pivot)
    L = []
    G = []

ayulockin

## DIVIDE -> mergesort
## CONQUER -> mergesort
## COMBINE -> merge

def merge(S1, S2, S):
    '''
    S1-> First sorted seq
    S2-> Second sorted seq
    S -> Original seq
    '''

ayulockin

ayulockin

import cv2
from scipy.spatial import distance as dist
import numpy as np

def resize(image, width=None, height=None, inter=cv2.INTER_AREA):
    dim = None
    (h, w) = image.shape[:2]

    # check to see if the width is None
    if width is None: