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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T06:59:46+00:00 2026-05-27T06:59:46+00:00

I have a text I need to find in each proposal max word and

  • 0

I have a text
I need to find in each proposal max word and min word.(Separated by dots)
I wrote a function to find it.
I’m trying to send first separated proposal to a function

calculateString(token);

.
After this variable token is truncated.
Thanks for answers!

Updated:
Question:I need to found in each proposal max and min text.On the first step it’s truncated.How can I avoid it?(Do not truncate after using it) –

Code:

//Output/input /cin/cout
#include <iostream>
//System libary
#include <cstdlib>

//include printf/sprintf/scanf
#include <stdio.h>

//include string libary
#include <string>

//
#include <ctype.h>
#include <conio.h>

using namespace std;

void calculateString(char *str){
    char *temp;
    int len;
    int i = 0;
    char** stringArray;
    string long_word,short_word;

    temp = strtok(str," ,.!?");
    cout << "Str:" <<  str << "\n";
    int string_count = 0;//counting first word in string. 
    int string_count_short = 0;
      stringArray = new char*[string_count];
        while(temp = strtok(NULL," ,.!?"))
        {
                //cout << "\n" << temp << "\n";
                len = strlen(temp);
                if(len>string_count || string_count == 0){
                    string_count = len;
                    long_word =  temp;
                }
                if(len<string_count_short || string_count_short == 0){
                    string_count_short = len;
                    short_word=  temp; 

                }
        }       
       cout << "Longest word in all text is:" <<  long_word << "\n";
       cout << "Shortest word in all text is:" <<  short_word << "\n";
}
int main()
{
   char str[] = "Hello it's a test.Lets go.How are you?Andrej";
   char seps[]   = ".";

   char *token;
   token = strtok( str, seps );
   while( token != NULL )
   {
      /* While there are tokens in "string" */
      cout << " :: " << token << " ||\n";
      calculateString(token);

      /* Get next token: */
      token = strtok( NULL, seps );
   }
    //calculateString(str);

    system("pause");
    return 0;
}
  • 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-27T06:59:47+00:00Added an answer on May 27, 2026 at 6:59 am

    Try something like this (this is hack)

    /*Const string count */
       const int string_count = 10;
       /*Total string found */
       int str_count = 0;
       /* String delimiter*/
       char seps[]   = ".";
    
       char *token;
       token = strtok( str, seps );
    
       /* Creating array of chars */
       char** stringArray;
       /* Dynamic array of chars*/
       stringArray = new char*[string_count];
    
       while( token != NULL )
       {
          /* While there are tokens in "string" */
          stringArray[++str_count] = token; 
          /* Get next token: */
          token = strtok( NULL, seps );
       }
       /* Seperated propsal */
       for(int i=1;i <=str_count;i++){
             calculateString(stringArray[i]);
       }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a block of text where I need yo find bits of text
Have a LINQ result, need to format it in plain text nicely to send
I have documents in which I need to find the text MM followed by
I have a set of nested DIV 's and I need to find each
In my application,i have text view with long text. i need text wrapping like
I have some text i need to filter out a list of bad words
I have a text where I need to: to extract the whole paragraph under
i have text like this div bla-bla end div i need to get only
I have text file with some text information and i need to split this
I have Text( http://www.mywebsite.com ) in a view, in which i need to provide

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.