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 8822363
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T06:05:23+00:00 2026-06-14T06:05:23+00:00

What is the preferred and best way in C++ to do this: Split the

  • 0

What is the preferred and best way in C++ to do this: Split the letters of the alphabeth into 7 groups so I can later ask if a char is in group 1, 3 or 4 etc… ? I can of course think of several ways of doing this myself but I want to know the standard and stick with it when doing this kinda stuff.

0
AEIOUHWY
1
BFPV
2
CGJKQSXZ
3
DT
4
MN
5
L

6
R
  • 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-06-14T06:05:24+00:00Added an answer on June 14, 2026 at 6:05 am

    Create a lookup table.

    int lookup[26] = { 0, 1, 2, 3, 0, 1, 2, 0 .... whatever };
    
    inline int getgroup(char c)
    {
        return lookup[tolower(c) - 'a'];
    }
    

    call it this way

    char myc = 'M';
    int grp = lookup(myc);
    

    Error checks omitted for brevity.

    Of course, depending on what the 7 groups represent , you can make enums instead of using 0, 1, 2 etc.

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

Sidebar

Related Questions

I'm trying to figure out the best way to insert content into a light
What would be the best way to split a user profile model and its
I am wondering what would be the best/preferred way to write a scanning app
What is the best/preferred way to select a (distinct) list of parent entities that
what's the best way to calculate the average? With this question I want to
Is there a canonical best-way-to-do-this for the following situation? I have a block of
I'm creating a class. What's the best practice for naming properties/methods when your preferred
What is the preferred way to work with Singleton class in multithreaded environment? Suppose
What is the preferred way of deploying a compojure/sinatra applications? I have multiple sites
Is there a preferred algorithm for converting a 2-digit year into a 4-digit year?

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.