Write code in any language dat processes a sentence(text only) and prints out the occurence of each letter of the alphabet in the sentence using the format

3 a's
2 b's
....
No z's

Default Text = "The quick brown Fox jumps over the lazy Dog"

Its sounds easy but I'm looking for the 'smallest' 'fool-proof' code

₱®ÌИСΞ:
Write code in any language dat processes a sentence(text only) and prints out the occurence of each letter of the alphabet in the sentence using the format

3 a's
2 b's
....
No z's

Default Text = "The quick brown Fox jumps over the lazy Dog"

Its sounds easy but I'm looking for the 'smallest' 'fool-proof' code

I would use a dynamically allocated memory... No need allocating memory for a 'z' when it might not be there...

lordZOUGA:
I would use a dynamically allocated memory... No need allocating memory for a 'z' when it might not be there...

Pls could u shed more light on dat?

I did this in a hurry its quite lengthy but it works

http://pastebin.ca/2206694

I'll see if i can write a shorter version...

Javanian: I did this in a hurry its quite lengthy but it works

http://pastebin.ca/2206694

I'll see if i can write a shorter version...

gr8 effort...thnx...
tho the main challenge is getting d job done in fewer lines of code
User input isn't rilly required cus I supplied a default text to process.....

Javanian has 142 lines...anybody?

Thanks but its actually 135 lines dont count the space..

and don't count it like that, i can easily remove 30 lines without actually adding or subtracting any code...

ok remove as much as u can.... The floor is still open

http://pastebin.ca/2206725

The same code in 66 lines

Hi Javanian i was wondering the need for you to declare array of chars. Anyway, here is my solution:

public class CharCounter{


String sentence="The quick brown Fox jumps over the lazy Dog";
int as,bs,cs,ds,es,fs,gs,hs,is,js,ks,ls,ms,ns,os,ps,qs,rs,ss,ts,us,vs,ws,xs,ys,zs;

public void countChar()
{
char[] Text = sentence.toLowerCase().toCharArray();
for (char text:Text)
switch(text)
{
case 'a':
as++;
break;
case 'b':
bs++;
break;
case 'c':
cs++;
break;

case 'd':
ds++;
break;

case 'e':
es++;
break;


case 'f':
fs++;
break;


case 'g':
gs++;
break;

case 'h':
hs++;
break;

case 'i':
is++;
break;
case 'j':
js++;
break;

case 'k':
ks++;
break;

case 'l':
ls++;
break;

case 'm':
ms++;
break;

case 'n':
ns++;
break;

case 'o':
os++;
break;

case 'p':
ps++;
break;


case 'q':
qs++;
break;




case 'r':
rs++;
break;

case 's':
ss++;
break;

case 't':
ts++;
break;

case 'u':
us++;
break;

case 'v':
vs++;
break;

case 'w':
ws++;
break;

case 'x':
xs++;
break;

case 'y':
ys++;
break;

case 'z':
zs++;
break;
}

}

public void printNoofOccuerrence()

{

System.out.println("There are " +as+" a's" );
System.out.println("There are " +bs+" b's" );
System.out.println("There are " +cs+" c's" );
System.out.println("There are " +ds+" d's" );
System.out.println("There are " +es+" e's" );
System.out.println("There are " +fs+" f's" );
System.out.println("There are " +gs+" g's" );
System.out.println("There are " +hs+" h's" );
System.out.println("There are " +is+" i's" );
System.out.println("There are " +js+" j's" );
System.out.println("There are " +ks+" k's" );
System.out.println("There are " +ls+" l's" );
System.out.println("There are " +ms+" m's" );
System.out.println("There are " +ns+" n's" );
System.out.println("There are " +os+" o's" );
System.out.println("There are " +qs+" q's" );
System.out.println("There are " +rs+" r's" );
System.out.println("There are " +ss+" s's" );
System.out.println("There are " +us+" u's" );
System.out.println("There are " +vs+" v's" );
System.out.println("There are " +ws+" w's" );
System.out.println("There are " +xs+" x's" );
System.out.println("There are " +ys+" y's" );
System.out.println("There are " +zs+" z's" );
}
public static void main(String[] args)
{

CharCounter cc = new CharCounter();
cc.countChar();
cc.printNoofOccuerrence();
}
}

Javanian: http://pastebin.ca/2206725

The same code in 66 lines

Javanian: Thanks but its actually 135 lines dont count the space..

The number of lines of your code does not determine how efficient it is.I will rather code for shorter running time than for shorter lines of code.

@otuabaroku I used a char array to compare it with the letter of the alphabets...

By the way, i will sue you for plagiarism ...you wrote another version of my code ...dont you know that code has a patent ...we will see in court!...lol...just kidding...You did a great job...

naija_swag:

The number of lines of your code does not determine how efficient it is.I will rather code for shorter running time than for shorter lines of code.

i know that but he was more interested in the number of lines so i wanted to prove to him that i can get it done in fewer lines...

Javanian: @otuabaroku I used a char array to compare it with the letter of the alphabets...

By the way, i will sue you for plagiarism ...you wrote another version of my code ...dont you know that code has a patent ...we will see in court!...lol...just kidding...You did a great job...

Oh I see. My bad, I would have stated "all rights reversed to Javanian". Forgive me I will not do it again.

naija_swag:

The number of lines of your code does not determine how efficient it is.I will rather code for shorter running time than for shorter lines of code.

The shorter the code the more complex the algorithm. and besides fewer code pays off when issues like size or readability is an issue
i need an answer with far less lines because it displays how skilled the programmer is with algorithm or and how easy or complex it is to implement such in various programming languages. i had implemented this in python before asking and it occupied far less lines...

floor is still open...@otuabaroku and @javanian gr8 job but still too much lines sha

₱®ÌИСΞ:

. i had implemented this in python before asking and it occupied far less lines...

doing this in a language like python or PHP will take far more less lines..

^ I will like to see it...so you still dey this forum?

omo_to_dun: Python: 15 lines

---

def word(s):
   a = [0] * 26
   s = s.lower()
   for c in s:
      i = ord(c) - 97
      if i > -1 and i < 26:
	     a[i] = a[i] + 1
   return a
def emit(a):
   for i in xrange(26):
      if a[i] == 0:
	     print("No {0}'s".format(chr(i + 97)))
	  else:
		 print("{0} {1}'s".format(a[i], chr(i + 97)))
emit(word("The quick brown Fox jumps over the lazy Dog"))

Wow...magnificent....bravo....shortest so far... but. 15 lines? Knock out a few and u hav it .... Floor is still open sha...

http://pastebin.ca/2206823

15 lines...this is the best i can go...

omo_to_dun: Ok, this lecturer is boring me. Here we go. Python: 9 lines

---

def word(s):
   a, s = [0] * 26, s.lower()
   for c in s:
      i = ord(c) - 97
      if i > -1 and i < 26: a[i] = a[i] + 1
   for i in xrange(26):
      if a[i] == 0: print("No {0}'s".format(chr(i + 97)))
	  else: print("{0} {1}'s".format(a[i], chr(i + 97)))
word("The quick brown Fox jumps over the lazy Dog")

---

Javanian: I'll do yours later

Cool......but...still knock out a lil...I noticed u used ascii method...nice approach

Javanian: http://pastebin.ca/2206823

15 lines...this is the best i can go...

Nice work..I am also goin 2 try 2 implement it in java...who knows, might be shorter

Floor iz wide open ...

Just six lines with C#:

{ string sentence = TextBox1.Text;
var sentenceQuery = from sentenceIn in sentence.ToLower().ToCharArray()
group sentenceIn by sentenceIn into m
select new { Key = m.Key, Count = m.Count() };
foreach (var item in sentenceQuery)
{Label1.Text += string.Format("Character: {0} Appears {1} time/s <br />", item.Key.ToString(), item.Count);}}}

Just loop through the characters, store in a hash (with the hash having entries by default 0 for keys that don't exist). Then output the hash.

Something like this: