Struct QuickSort 

pub struct QuickSort { /* private fields */ }

Quick Sort algorithm implementation

Implementations

impl QuickSort

pub fn new() -> Self

Create a new QuickSort instance

Trait Implementations

impl Debug for QuickSort

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for QuickSort

fn default() -> Self

Returns the “default value” for a type.

impl Sorter for QuickSort

fn step(&mut self, budget: usize) -> StepResult

Execute one step of the sorting algorithm

fn is_complete(&self) -> bool

Check if the algorithm has completed sorting

fn get_telemetry(&self) -> Telemetry

Get current telemetry data

fn reset(&mut self, data: Vec<i32>)

Reset the algorithm with new data

fn name(&self) -> &str

Get the algorithm’s display name

fn get_array(&self) -> &[i32]

Get current array state (for visualization)

fn get_memory_usage(&self) -> usize

Get auxiliary memory usage in bytes

fn as_any(&self) -> &dyn Any

Support downcasting for type-specific operations

fn as_any_mut(&mut self) -> &mut dyn Any

Support mutable downcasting for type-specific operations