Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6844203
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T00:20:49+00:00 2026-05-27T00:20:49+00:00

I must be an idiot, but I just cannot find a way to solve

  • 0

I must be an idiot, but I just cannot find a way to solve this issue:

I want to make a program that takes a jumbled set of chars. and find all possible English words. My issue is that for the life of me I can’t figure out how to make all possible combinations of words. I’m fine with the dictionary cross-check, but it’s the jumbling that I’m having issues with. Could someone help with this?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-27T00:20:50+00:00Added an answer on May 27, 2026 at 12:20 am

    Since you are working in C++, you could use the next_permutation() algorithm from the standard template library: http://www.cplusplus.com/reference/algorithm/next_permutation/

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I must create this table, but colspan and rowspan make my brain crazy. Please
I must be getting daft, but I can't seem to find how to read
I know that somewhere in the history of the internet this must have been
I feel like this must be very simple, but for some reason I am
I know I MUST be a total idiot, but I don't see anything in
Okay, I must be an idiot, because this is my 3rd question for today.
Must be simple but cant find my answer. How to test whether one of
Must be a simple question, but I cannot for the life of me figure
I have a page that I want to execute via cron. It just does
Must Support IE6 and must Validate vs XHTML Strict 1.0! This is tricky to

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.