This example simulates ranked-choice voting for four candidates across a population of 100 million fictional voters, using JavaScript to generate random preference permutations. It demonstrates the instant-runoff process by tallying first-choice votes, eliminating the lowest-scoring candidate, redistributing those ballots to their next preferred choice, and repeating until a majority winner emerges. The console output shows the round-by-round counts and declares the final winner, illustrating how the algorithm handles vote transfers and majority thresholds.