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

Semrush - keyword research tool

Turn ChatGPT, Claude, Gemini, And CoPilot Into Your Personal Assistant, Business Coach, Content Creator, And More

AFFILIATE MARKETING Your all-in-one performance engine Manage affiliates, creators, and customer referrals in one unified platform—turning every partnership into measurable growth
Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

42,690 questions

55,449 answers

573 users

How to print all possible permutations (all possible orderings) of the words in Python

2 Answers

0 votes
from itertools import permutations

words = ["word-1", "word-2", "word-3"]

for p in permutations(words):
    print(" ".join(p))



'''
run:

word-1 word-2 word-3
word-1 word-3 word-2
word-2 word-1 word-3
word-2 word-3 word-1
word-3 word-1 word-2
word-3 word-2 word-1

'''

 



answered Apr 14 by avibootz
0 votes
def print_words_permutations(words, current=[]):
    if not words:
        print(" ".join(current))
        return

    for i in range(len(words)):
        remaining = words[:i] + words[i+1:]
        print_words_permutations(remaining, current + [words[i]]) # Recursive

words = ["word-1", "word-2", "word-3"]

print_words_permutations(words)



'''
run:

word-1 word-2 word-3
word-1 word-3 word-2
word-2 word-1 word-3
word-2 word-3 word-1
word-3 word-1 word-2
word-3 word-2 word-1

'''

 



answered Apr 14 by avibootz

Related questions

...