import time
import random
import sys

# ---------------------------------------------------------
# Student Info [cite: 15-18]
# ---------------------------------------------------------
# Student Name: 
# ID: 
# Group#: 
# ---------------------------------------------------------

# ==========================================
# 1. Quicksort Implementation [cite: 53-73]
# ==========================================
def partition(arr, left, right):
    pivot = arr[left] # Choose first element as pivot [cite: 62]
    i = left
    
    for j in range(left + 1, right + 1):
        if arr[j] < pivot:
            i += 1
            arr[i], arr[j] = arr[j], arr[i]
            
    # Place pivot in correct position
    arr[left], arr[i] = arr[i], arr[left]
    return i

def quicksort(arr, left = None, right = None):
    if left is None: 
        left = 0

    if right is None: 
        right = len(arr) - 1

    if left < right:
        p = partition(arr, left, right)
        quicksort(arr, left, p - 1)
        quicksort(arr, p + 1, right)

def compare_sorts(arr: list):

    start = time.time()
    copy = arr.copy()
    quicksort(copy)
    end = time.time()

    print(f'quick sort result: {copy}')
    print(f'quick sort took {(end - start) * 1000}ms')

a = [12, 5, 9, 1, 14, 3, 7]
compare_sorts(a)

الملف حتى الان: https://t.me/c/2934627429/626

التتبع كامل: https://claude.ai/public/artifacts/4c06f23d-06ad-4be4-b0dc-ee9eccbe71bb