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,950 questions

51,892 answers

573 users

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

1 Answer

0 votes
object KthSmallestFinder {
  def findKthSmallestNumber(arr: Array[Int], k: Int): Int = {
    arr.sorted.apply(k - 1)
  }

  def main(args: Array[String]): Unit = {
    val arr = Array(42, 90, 21, 30, 37, 81, 45)
    val k = 3

    val result = findKthSmallestNumber(arr, k)
    println(result) // Output: 37
  }
}



/*
run:

37

*/

 



answered Nov 12, 2025 by avibootz
...