1. Given two numbers, n and k ( 0< n, k <=12), generate all the pemutations taking k letters from n letters (nPk) considering first n small alphabets. 2. Use the idea of backtracking (recursion).

My account
Edit my Profile
Private messages
My favorites

Ask a Question
Questions
Unanswered
Tags
Categories
Ask a Question

asked Mar 16, 2021 43.6k views

2 votes

1. Given two numbers, n and k ( 0< n, k <=12), generate all the pemutations taking k letters from n letters (nPk) considering first n small alphabets.

2. Use the idea of backtracking (recursion).

Computers and Technology
middle-school

Jeffehobbs asked

by Jeffehobbs

6.8k points

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

2 votes

It is 5jsjsjdhhdhdhdhdhdhdhdhdhd

Ali Imran answered Mar 22, 2021

by Ali Imran

5.4k points

0 Comments

Please log in or register to add a comment.

Ask a Question

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

6.6m questions

8.8m answers

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 Comments

Please log in or register to add a comment.

Other Questions