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

51,826 answers

573 users

How to generate all possible permutations of a string in Scala

1 Answer

0 votes
object PermutationsOfAString {
  def permutations(str: String): List[String] = {
    def permute(chars: Array[Char], l: Int, r: Int, result: List[String]): List[String] = {
      if (l == r) {
        (chars.mkString :: result).reverse 
      } else {
        var res = result
        for (i <- l to r) {
          swap(chars, l, i)
          res = permute(chars, l + 1, r, res)
          swap(chars, l, i) 
        }
        res
      }
    }

    def swap(chars: Array[Char], i: Int, j: Int): Unit = {
      val temp = chars(i)
      chars(i) = chars(j)
      chars(j) = temp
    }

    permute(str.toCharArray, 0, str.length - 1, List.empty[String])
  }

  def main(args: Array[String]): Unit = {
    val str = "abc"
    
    val result = permutations(str)
    
    println(result) 
  }
}

  
  
/*
run:
    
List(cba, bac, abc, acb, bca, cab)
  
*/

 



answered Jan 5, 2025 by avibootz
...