sorting-race 0.2.0

Terminal-based sorting algorithm race visualization tool with real-time metrics
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

//! Test that memory usage is properly displayed

use sorting_race::models::traits::Sorter;
use sorting_race::services::sorters::{bubble::BubbleSort, merge::MergeSort, quick::QuickSort};

#[test]
fn test_bubble_sort_reports_memory() {
    let mut sorter = BubbleSort::new();
    let test_data = vec![5, 2, 8, 1, 9];

    sorter.reset(test_data);

    let telemetry = sorter.get_telemetry();
    assert!(
        telemetry.memory_current > 0,
        "BubbleSort should report memory usage"
    );

    // Should be at least 5 * 4 = 20 bytes for 5 integers
    assert!(
        telemetry.memory_current >= 20,
        "BubbleSort memory should be at least 20 bytes, got {}",
        telemetry.memory_current
    );
}

#[test]
fn test_merge_sort_reports_extra_memory() {
    let mut sorter = MergeSort::new();
    let test_data = vec![5, 2, 8, 1, 9];

    sorter.reset(test_data);

    let telemetry = sorter.get_telemetry();
    // Merge sort uses temp buffer, so should be > 20 bytes
    assert!(
        telemetry.memory_current > 20,
        "MergeSort should report extra memory for temp buffer, got {}",
        telemetry.memory_current
    );
}

#[test]
fn test_quick_sort_reports_memory() {
    let mut sorter = QuickSort::new();
    let test_data = vec![5, 2, 8, 1, 9];

    sorter.reset(test_data);

    let telemetry = sorter.get_telemetry();
    assert!(
        telemetry.memory_current > 0,
        "QuickSort should report memory usage"
    );
    // Quick sort has data array (20 bytes) + small stack overhead
    assert!(
        telemetry.memory_current >= 16,
        "QuickSort memory should report some memory usage, got {}",
        telemetry.memory_current
    );
}