DZone
Thanks for visiting DZone today,
Edit Profile
  • Manage Email Subscriptions
  • How to Post to DZone
  • Article Submission Guidelines
Sign Out View Profile
  • Post an Article
  • Manage My Drafts
Over 2 million developers have joined DZone.
Log In / Join
Refcards Trend Reports Events Over 2 million developers have joined DZone. Join Today! Thanks for visiting DZone today,
Edit Profile Manage Email Subscriptions Moderation Admin Console How to Post to DZone Article Submission Guidelines
View Profile
Sign Out
Refcards
Trend Reports
Events
Zones
Culture and Methodologies Agile Career Development Methodologies Team Management
Data Engineering AI/ML Big Data Data Databases IoT
Software Design and Architecture Cloud Architecture Containers Integration Microservices Performance Security
Coding Frameworks Java JavaScript Languages Tools
Testing, Deployment, and Maintenance Deployment DevOps and CI/CD Maintenance Monitoring and Observability Testing, Tools, and Frameworks
Culture and Methodologies
Agile Career Development Methodologies Team Management
Data Engineering
AI/ML Big Data Data Databases IoT
Software Design and Architecture
Cloud Architecture Containers Integration Microservices Performance Security
Coding
Frameworks Java JavaScript Languages Tools
Testing, Deployment, and Maintenance
Deployment DevOps and CI/CD Maintenance Monitoring and Observability Testing, Tools, and Frameworks

Permutations Computer

  user avatar by
·
Apr. 13, 11 · Code Snippet
Like (0)
Save
Tweet
Share
568 Views

Join the DZone community and get the full member experience.

Join For Free
Permutations counter. Enter N=x where x is the permutation size
ie: N=4 gives all the permutations of numbers between 1 and 4


#!/usr/bin/env ruby

# PERMUTATIONS COMPUTER
# based on Bogomolyn algorithm
# http://www.bearcave.com/random_hacks/permute.html
# Author: Alessio Saltarin http://axsaxs.altervista.org/

class PermutationComputer

  attr_reader :bigbox  # Array of permutations
  attr_reader :count   # Number of elements found

  def initialize(size)
    @permutationSize = size
    @bigbox = Array.new
    @level = -1
    @count = 1
    @numbers = Array.new(@permutationSize)
    (@permutationSize-1).downto(0) { |j| @numbers[j] = 0}
  end

  def compute()
    visit(@numbers, 0)
    @count -= 1
  end

  def visit(numberArray, k)
    @level += 1
    numberArray[k] = @level
    if (@level == @permutationSize)
      @bigbox << numberArray.dup # we pass the value, not the reference!
      @count += 1
    else
      0.upto(@permutationSize - 1) do |i|
        if (numberArray[i] == 0)
          visit(numberArray, i)
        end
      end
    end
    @level -= 1
    numberArray[k] = 0
  end
  
end

puts "Bogolomyn Permutations Computer v.1.0"
 # Permutations of numbers between 1 and 4
permutations = PermutationComputer.new(4)
puts "== START COMPUTING PERMUTATIONS =="
permutations.compute
puts "== #{permutations.count} elements found:"
permutations.bigbox.each do
  |line| puts line.inspect
end
puts "== END =="

Computer

Opinions expressed by DZone contributors are their own.

Popular on DZone

  • Asynchronous HTTP Requests With RxJava
  • Why You Should Automate Code Reviews
  • Kubernetes vs Docker: Differences Explained
  • Taming Cloud Costs With Infracost

Comments

Partner Resources

X

ABOUT US

  • About DZone
  • Send feedback
  • Careers
  • Sitemap

ADVERTISE

  • Advertise with DZone

CONTRIBUTE ON DZONE

  • Article Submission Guidelines
  • Become a Contributor
  • Visit the Writers' Zone

LEGAL

  • Terms of Service
  • Privacy Policy

CONTACT US

  • 600 Park Offices Drive
  • Suite 300
  • Durham, NC 27709
  • support@dzone.com
  • +1 (919) 678-0300

Let's be friends: