It looks like you're new here. If you want to get involved, click one of these buttons!

- 141.9K All Categories
- 104.8K Programming Languages
- 6.4K Assembler Developer
- 1.9K Basic
- 39.9K C and C++
- 4.3K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 2K PHP
- 526 Python
- 37 Ruby
- 4.4K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 312 Console programming
- 89 DirectX Game dev
- 1 Minecraft
- 110 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 733 Computer Hardware
- 3.5K Database & SQL
- 534 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 257 XML Development
- 3.3K Classifieds
- 198 Co-operative Projects
- 189 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 602 Jobs Wanted
- 203 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 3.4K Miscellaneous
- 6 Join the Team
- 0 User Profiles
- 354 Comments on this site
- 66 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 613 Off topic board
- 179 Mobile & Wireless
- 53 Android
- 124 Palm Pilot
- 335 Multimedia
- 151 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 22 Cloud Computing
- 53 FreeBSD
- 1.7K LINUX programming
- 369 MS-DOS
- 0 Shell scripting
- 320 Windows CE & Pocket PC
- 4.1K Windows programming
- 913 Software Development
- 409 Algorithms
- 68 Object Orientation
- 89 Project Management
- 90 Quality & Testing
- 256 Security
- 7.6K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 35 JQuery
- 292 WEB Servers
- 154 WEB-Services / SOAP

turbo pascal
Member Posts: **13**

in Matlab

Hi, I have a program that should read a line of text and output the number of words in the line and the number of occurrences of each letter. the output of the letters must be in alphabetical order counting both upper and lowercase versions .(ex input: Hello Hi. And the output: there are 2 words

1 e

2 h

1 i

2 l

1 o

I've done the first part but I couldn't solve the second part. first, I changed all the uppercase to lowercase.then,I found this sort but I have the spaces and other punctuations showing with it..

do

{

finish = 0;

for ( i = 0; i < x - 1; i++) // sorting the string..

{

if (s[i] > s[i + 1])

{

hold = s[i];

s[i] = s[i + 1];

s[i + 1] = hold;

finish = 1;

}

}

}while (finish != 0) ;

* so I decided to delete everything that is not a letter but it didn't work…

for (i=0; i<size; i++) // string contains only letters..

if (isalpha(s[i]))

temp[i]=s[i] ;

* and I thought of another way that it didn't work..

for (i=0; i<size; i++) // string contains only letters..

if (!isalpha(s[i]))

s[i]=s[i+1] ;

* finally I decided to do the counting any way, but I have the occurrences of each letter repeated as many times as it occurred, as well as ,counting punctuations.

for ( i=0;i<x;i++) //counting the occurrences of each letter..

{ for(j=0;j<x;j++)

{

if (s[i]==s[j])

a++ ;

}

cout << s[i] << " occured : " <<a << endl;

a=0;

}

cout << endl;

return 0;

}

1 e

2 h

1 i

2 l

1 o

I've done the first part but I couldn't solve the second part. first, I changed all the uppercase to lowercase.then,I found this sort but I have the spaces and other punctuations showing with it..

do

{

finish = 0;

for ( i = 0; i < x - 1; i++) // sorting the string..

{

if (s[i] > s[i + 1])

{

hold = s[i];

s[i] = s[i + 1];

s[i + 1] = hold;

finish = 1;

}

}

}while (finish != 0) ;

* so I decided to delete everything that is not a letter but it didn't work…

for (i=0; i<size; i++) // string contains only letters..

if (isalpha(s[i]))

temp[i]=s[i] ;

* and I thought of another way that it didn't work..

for (i=0; i<size; i++) // string contains only letters..

if (!isalpha(s[i]))

s[i]=s[i+1] ;

* finally I decided to do the counting any way, but I have the occurrences of each letter repeated as many times as it occurred, as well as ,counting punctuations.

for ( i=0;i<x;i++) //counting the occurrences of each letter..

{ for(j=0;j<x;j++)

{

if (s[i]==s[j])

a++ ;

}

cout << s[i] << " occured : " <<a << endl;

a=0;

}

cout << endl;

return 0;

}

Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven LLC

© 1997-2015 Programmersheaven.com - All rights reserved.

## Comments

8: Hi, I have a program that should read a line of text and output the number of words in the line and the number of occurrences of each letter. the output of the letters must be in alphabetical order counting both upper and lowercase versions .(ex input: Hello Hi. And the output: there are 2 words

: 1 e

: 2 h

: 1 i

: 2 l

: 1 o

:

: I've done the first part but I couldn't solve the second part. first, I changed all the uppercase to lowercase.then,I found this sort but I have the spaces and other punctuations showing with it..

: do

: {

: finish = 0;

: for ( i = 0; i < x - 1; i++) // sorting the string..

: {

: if (s[i] > s[i + 1])

: {

: hold = s[i];

: s[i] = s[i + 1];

: s[i + 1] = hold;

:

: finish = 1;

: }

: }

: }while (finish != 0) ;

:

: * so I decided to delete everything that is not a letter but it didn't work…

:

: for (i=0; i<size; i++) // string contains only letters..

: if (isalpha(s[i]))

: temp[i]=s[i] ;

: * and I thought of another way that it didn't work..

:

: for (i=0; i<size; i++) // string contains only letters..

: if (!isalpha(s[i]))

: s[i]=s[i+1] ;

:

: * finally I decided to do the counting any way, but I have the occurrences of each letter repeated as many times as it occurred, as well as ,counting punctuations.

:

: for ( i=0;i<x;i++) //counting the occurrences of each letter..

: { for(j=0;j<x;j++)

: {

: if (s[i]==s[j])

: a++ ;

: }

: cout << s[i] << " occured : " <<a << endl;

: a=0;

: }

: cout << endl;

: return 0;

: }

:

:

:

:

:

:

: