a7fe11fd74
- Implemented Randomized Quicksort algorithm with performance analysis - Implemented Hash Table with Chaining for collision resolution - Added comprehensive test suite (30+ test cases) - Created test runner script with multiple test options - Added detailed README with architecture diagrams and documentation - Added MIT License - Includes examples and comprehensive documentation
151 lines
5.1 KiB
Python
151 lines
5.1 KiB
Python
"""
|
|
Unit tests for Randomized Quicksort implementation.
|
|
"""
|
|
|
|
import unittest
|
|
import random
|
|
from src.quicksort import (
|
|
randomized_quicksort,
|
|
partition,
|
|
randomized_partition,
|
|
compare_with_builtin,
|
|
analyze_performance
|
|
)
|
|
|
|
|
|
class TestRandomizedQuicksort(unittest.TestCase):
|
|
"""Test cases for randomized quicksort algorithm."""
|
|
|
|
def test_empty_array(self):
|
|
"""Test sorting an empty array."""
|
|
arr = []
|
|
result = randomized_quicksort(arr)
|
|
self.assertEqual(result, [])
|
|
|
|
def test_single_element(self):
|
|
"""Test sorting an array with a single element."""
|
|
arr = [42]
|
|
result = randomized_quicksort(arr)
|
|
self.assertEqual(result, [42])
|
|
|
|
def test_sorted_array(self):
|
|
"""Test sorting an already sorted array."""
|
|
arr = [1, 2, 3, 4, 5]
|
|
result = randomized_quicksort(arr)
|
|
self.assertEqual(result, [1, 2, 3, 4, 5])
|
|
|
|
def test_reverse_sorted_array(self):
|
|
"""Test sorting a reverse sorted array."""
|
|
arr = [5, 4, 3, 2, 1]
|
|
result = randomized_quicksort(arr)
|
|
self.assertEqual(result, [1, 2, 3, 4, 5])
|
|
|
|
def test_random_array(self):
|
|
"""Test sorting a random array."""
|
|
arr = [64, 34, 25, 12, 22, 11, 90, 5]
|
|
result = randomized_quicksort(arr)
|
|
expected = sorted(arr)
|
|
self.assertEqual(result, expected)
|
|
|
|
def test_duplicate_elements(self):
|
|
"""Test sorting an array with duplicate elements."""
|
|
arr = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3]
|
|
result = randomized_quicksort(arr)
|
|
expected = sorted(arr)
|
|
self.assertEqual(result, expected)
|
|
|
|
def test_negative_numbers(self):
|
|
"""Test sorting an array with negative numbers."""
|
|
arr = [-5, -2, -8, 1, 3, -1, 0]
|
|
result = randomized_quicksort(arr)
|
|
expected = sorted(arr)
|
|
self.assertEqual(result, expected)
|
|
|
|
def test_large_array(self):
|
|
"""Test sorting a large array."""
|
|
arr = [random.randint(1, 10000) for _ in range(1000)]
|
|
result = randomized_quicksort(arr)
|
|
expected = sorted(arr)
|
|
self.assertEqual(result, expected)
|
|
|
|
def test_original_array_not_modified(self):
|
|
"""Test that the original array is not modified."""
|
|
arr = [64, 34, 25, 12, 22, 11, 90, 5]
|
|
original = arr.copy()
|
|
randomized_quicksort(arr)
|
|
self.assertEqual(arr, original)
|
|
|
|
def test_all_same_elements(self):
|
|
"""Test sorting an array with all same elements."""
|
|
arr = [5, 5, 5, 5, 5]
|
|
result = randomized_quicksort(arr)
|
|
self.assertEqual(result, [5, 5, 5, 5, 5])
|
|
|
|
|
|
class TestPartition(unittest.TestCase):
|
|
"""Test cases for partition function."""
|
|
|
|
def test_partition(self):
|
|
"""Test partition function."""
|
|
arr = [64, 34, 25, 12, 22, 11, 90, 5]
|
|
pivot_idx = partition(arr, 0, len(arr) - 1)
|
|
|
|
# Check that pivot is in correct position
|
|
pivot_value = arr[pivot_idx]
|
|
# All elements before pivot should be <= pivot
|
|
for i in range(0, pivot_idx):
|
|
self.assertLessEqual(arr[i], pivot_value)
|
|
# All elements after pivot should be >= pivot
|
|
for i in range(pivot_idx + 1, len(arr)):
|
|
self.assertGreaterEqual(arr[i], pivot_value)
|
|
|
|
def test_randomized_partition(self):
|
|
"""Test randomized partition function."""
|
|
arr = [64, 34, 25, 12, 22, 11, 90, 5]
|
|
pivot_idx = randomized_partition(arr, 0, len(arr) - 1)
|
|
|
|
# Check that pivot is in correct position
|
|
pivot_value = arr[pivot_idx]
|
|
# All elements before pivot should be <= pivot
|
|
for i in range(0, pivot_idx):
|
|
self.assertLessEqual(arr[i], pivot_value)
|
|
# All elements after pivot should be >= pivot
|
|
for i in range(pivot_idx + 1, len(arr)):
|
|
self.assertGreaterEqual(arr[i], pivot_value)
|
|
|
|
|
|
class TestPerformanceComparison(unittest.TestCase):
|
|
"""Test cases for performance comparison utilities."""
|
|
|
|
def test_compare_with_builtin(self):
|
|
"""Test comparison with built-in sort."""
|
|
arr = [random.randint(1, 1000) for _ in range(100)]
|
|
comparison = compare_with_builtin(arr)
|
|
|
|
self.assertIn('quicksort_time', comparison)
|
|
self.assertIn('builtin_time', comparison)
|
|
self.assertIn('speedup', comparison)
|
|
self.assertIn('is_correct', comparison)
|
|
self.assertIn('array_length', comparison)
|
|
|
|
self.assertTrue(comparison['is_correct'])
|
|
self.assertEqual(comparison['array_length'], 100)
|
|
self.assertGreater(comparison['quicksort_time'], 0)
|
|
self.assertGreater(comparison['builtin_time'], 0)
|
|
|
|
def test_analyze_performance(self):
|
|
"""Test performance analysis."""
|
|
results = analyze_performance([100, 1000])
|
|
|
|
self.assertEqual(len(results), 2)
|
|
for result in results:
|
|
self.assertIn('quicksort_time', result)
|
|
self.assertIn('builtin_time', result)
|
|
self.assertIn('is_correct', result)
|
|
self.assertTrue(result['is_correct'])
|
|
|
|
|
|
if __name__ == '__main__':
|
|
unittest.main()
|
|
|