How to find the Kth smallest number in an unsorted array in Rust

1 Answer

0 votes
fn find_kth_smallest_number(arr: &mut [i32], k: usize) -> i32 {
    arr.sort();
    
    arr[k - 1]
}

fn main() {
    let mut arr = [42, 90, 21, 30, 37, 81, 45];
    let k = 3;

    let result = find_kth_smallest_number(&mut arr, k);
    println!("{}", result); 
}




/*
run:

37

*/



 



answered 14 hours ago by avibootz
...