Home › Applications › Matlab

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

- 140.5K All Categories
- 104.3K Programming Languages
- 6.4K Assembler Developer
- 1.8K Basic
- 39.7K C and C++
- 4.2K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 1.9K PHP
- 505 Python
- 48 Ruby
- 4.3K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 309 Console programming
- 88 DirectX Game dev
- 1 Minecraft
- 108 Newbie Game Programmers
- 2 Oculus Rift
- 8.9K Applications
- 1.8K Computer Graphics
- 726 Computer Hardware
- 3.4K Database & SQL
- 520 Electronics development
- 1.6K Matlab
- 627 Sound & Music
- 254 XML Development
- 3.3K Classifieds
- 189 Co-operative Projects
- 175 For sale
- 189 FreeLance Software City
- 1.9K Jobs Available
- 598 Jobs Wanted
- 201 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 2.9K Miscellaneous
- 3 Join the Team
- 2 User Profiles
- 353 Comments on this site
- 58 Computer Emulators
- 1.8K General programming
- 137 New programming languages
- 596 Off topic board
- 161 Mobile & Wireless
- 35 Android
- 124 Palm Pilot
- 334 Multimedia
- 151 Demo programming
- 183 MP3 programming
- 0 Bash scripts
- 15 Cloud Computing
- 52 FreeBSD
- 1.7K LINUX programming
- 365 MS-DOS
- 0 Shell scripting
- 319 Windows CE & Pocket PC
- 4.1K Windows programming
- 879 Software Development
- 401 Algorithms
- 67 Object Orientation
- 84 Project Management
- 88 Quality & Testing
- 232 Security
- 7.5K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 222 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 33 JQuery
- 283 WEB Servers
- 108 WEB-Services / SOAP

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

turbo pascal
Posts: **13**Member

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;

}

About & Contact / 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-2013 Programmersheaven.com - All rights reserved.

## Comments

8Member: 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;

: }

:

:

:

:

:

:

:

- Spam

0 · Vote Down Vote Up · Share on Facebook