Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,948 questions

51,890 answers

573 users

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 Nov 12, 2025 by avibootz
...