question e.g help here

This is a discussion on question e.g help here within the C Programming forums, part of the General Programming Boards category; OK! I have create this. I insert some word and look how big is it. And then made from how ...

  1. #1
    Registered User xxxrugby's Avatar
    Join Date
    Jan 2005
    Posts
    178

    question e.g help here

    OK!
    I have create this. I insert some word and look how big is it. And then made from how long is it. factorial from that number. And then I see that from that word you can make n! different words.

    Question is or help here.
    How can I made that all that n! different combination of that word i write out.
    Need some sugestions how to do that.
    Or code if somebody already have one!
    Sorry for spelling errors, not English!
    xxxrugby: "All Human Race Will Die From My Hand!"
    xxxrugby: "We are all philosophers, when question is about politics!"

  2. #2
    Chief Code Coloniser!
    Join Date
    Apr 2005
    Posts
    121
    Do your own homework.

  3. #3
    Registered User xxxrugby's Avatar
    Join Date
    Jan 2005
    Posts
    178
    Quote Originally Posted by TheColonial
    Do your own homework.
    It is not my homework.
    I do not post my homeworks!

    In my message up it say that you dont have to give me code. Just help in how to do that.
    All can be done in words.

    do your homework do your homework. Cry Baby
    Sorry for spelling errors, not English!
    xxxrugby: "All Human Race Will Die From My Hand!"
    xxxrugby: "We are all philosophers, when question is about politics!"

  4. #4
    ATH0 quzah's Avatar
    Join Date
    Oct 2001
    Posts
    14,826
    1) Read a word in. See the FAQ for details.
    2) Get the length of the word. (strlen anyone?)
    3) Search the forum for the word factorial.
    4) Search the forum for the word permutation.
    5) Put it all together.
    6) Realize that you're using the term "Cry Baby" incorrectly, or don't understand what it actually means.

    Quzah.
    Hope is the first step on the road to disappointment.

  5. #5
    Chief Code Coloniser!
    Join Date
    Apr 2005
    Posts
    121
    xxxrugby: thanks for the laugh I needed it!

  6. #6
    Registered User xxxrugby's Avatar
    Join Date
    Jan 2005
    Posts
    178
    1) Read a word in. See the FAQ for details.
    2) Get the length of the word. (strlen anyone?)
    3) Search the forum for the word factorial.
    4) Search the forum for the word permutation.
    5) Put it all together.

    I got all of these. Done.

    But I wanna discuss how to make all that word combinations out on screen.
    Sorry for spelling errors, not English!
    xxxrugby: "All Human Race Will Die From My Hand!"
    xxxrugby: "We are all philosophers, when question is about politics!"

  7. #7
    Bob Dole for '08 B0bDole's Avatar
    Join Date
    Sep 2004
    Posts
    618
    Hint: use a recursive function
    Hmm

  8. #8
    ATH0 quzah's Avatar
    Join Date
    Oct 2001
    Posts
    14,826
    You most definately did not "got all those. Done.", because if you had, you'd be done with the project and wouldn't be asking anything at all. All you have to do is look at some of the examples in the searched links I provided, and you'll basicly have the entire program already done for you.

    Quzah.
    Hope is the first step on the road to disappointment.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. question on time complexity
    By blue_gene in forum C++ Programming
    Replies: 10
    Last Post: 05-16-2004, 05:09 AM
  2. Question...
    By TechWins in forum A Brief History of Cprogramming.com
    Replies: 16
    Last Post: 07-28-2003, 09:47 PM
  3. opengl DC question
    By SAMSAM in forum Game Programming
    Replies: 6
    Last Post: 02-26-2003, 08:22 PM
  4. Question about linked lists.
    By cheeisme123 in forum C++ Programming
    Replies: 6
    Last Post: 02-25-2003, 12:36 PM
  5. Question, question!
    By oskilian in forum A Brief History of Cprogramming.com
    Replies: 5
    Last Post: 12-24-2001, 12:47 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21