What is the value of k for this algorithm?

Question

1.00/5 (1 vote)

See more:

k ← 0
n ← length(str)
for each permutation of str
j ← 1
while (j ≤ n)
k ← k + 1
j ← j + 1
print k

What I have tried:

i have tried to find out the answer what i am getting is n^2.

Posted 28-Jun-16 20:45pm

Member 12609408

Updated 28-Jun-16 22:02pm

Tadit Dash (ତଡିତ୍ କୁମାର ଦାଶ)

Add a Solution

Comments

OriginalGriff 29-Jun-16 3:10am

Without the code you implemented the algorithm with, we have no idea if you did it right...
Use the "Improve question" widget to edit your question and provide better information.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

KarstenK · Answer 1 · 2016-06-28T22:02:00

Solution 1

Your questions isnt only vague, but looks like a homework (which class?) to learn the language C.

Here is a fine C-Tutorial, where you can learn some basic knowledge. I recommand you to install and use the Visual Studio IDE.

Good luck.

Posted 28-Jun-16 22:02pm

KarstenK