It is a Data Structure work J4amieC. Anyway thank you.

on a Command Line.

My English is not good. But I mean something like that: int count(POINTER head) { return head!=NULL ? count(head->next)+1 : 0 ; } But not to return the value. I WANT TO DISPLAY THE VALUE.(and this is difficult)

It is absolutely sure that I can not do that, although I have tried very much. Any idea?

This is not a C# question but an algorithm question for my homework at university.

Could someone give me an algorithm of a recursive function to return the max key of nodes of a singly connected list?

Could someone give me an algorithm of a recursive function to display-NOT TO RETURN-the number of nodes of a singly connected list?

It is too slow for large richTextBoxes. Maybe using pointers or something else?

It doesn't work.

Is there a faster way to give a specific color in a richTextBox? void makeThisRed(int start, int length) { richTextBox1.Select(start,length); richTextBox1.SelectionColor= Color.Red; }

I want to match multiple-line comments from /* to */ so I use: Regex regex = new Regex("/\\*(**.|[\r\n]**)*?\\*/");

Is there something faster than .|[\r\n] in Regular Expressions ?

In general when I know exactly the keywords(about 300) I want to find should I use something like: 1)Regex(@"if|do|for|while|int|Int32|Int64...(about 300)") or 2)Regex(@"[_A-Za-z]+[A-Za-z]\w*] and follows searching in a hashtable?

It finds all the words which start with _ or letter and contains only _ letters numbers.

Thanks Leppie.

I want to make it smaller and faster.

Regex(@"[_A-Za-z]+[A-Za-z]\w*") Can it be improved ?

Thank you Dominic Farr .

for( ; ; ) by itself is very fast. But to access elements in an array using indexes is slow.

I think this is very slow for a long string. I was thinking something like: string st = "a very long string" ; System.Text.StringBuilder sb = new System.Text.StringBuilder(st); System.Text.StringBuilder sb2 = new System.Text.StringBuilder(""); foreach(char ch in sb.ToString()) sb2.Insert(0,ch); foreach(char ch in sb2.ToString()) { ///////// } but I'm looking for something more faster.