|
It looks very impressive. What does it do?
|
|
|
|
|
Found out about SheetCalculator[^] today.
Very nice!
There are II kinds of people in the world, those who understand binary and those who understand Roman numerals. Web - Blog - RSS - Math
|
|
|
|
|
Looks very interesting 
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon
|
|
|
|
|
Yeah, and the perfect excuse to learn Java.
There are II kinds of people in the world, those who understand binary and those who understand Roman numerals. Web - Blog - RSS - Math
|
|
|
|
|
Hello,
I'm an Italian student and I'm new on this site.
I have to implement in Java the Map abstract data type with separate chaining collison handlin without using java.util classes.
Is there anyone who could help me please?Because I've some doubts.
Thanks in advance,
Giorgio Vezzaro 
|
|
|
|
|
You might want to try some Java specific forum.
"I guess it's what separates the professionals from the drag and drop, girly wirly, namby pamby, wishy washy, can't code for crap types." - Pete O'Hanlon
|
|
|
|
|
This is a C#-forum - so nobody will help you with java-code.
So some simple questions: are the algorithms clear?
(You will want to implement a hash-function mapping integer-values (the hash-values) to some memory-address containing - in it's simplest form - the head of a linked list containing all the stored objects).
|
|
|
|
|
CKnig wrote: his is a C#-forum - so nobody will help you with java-code.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
|
|
|
|
|
What's the matter?
He was asking for help in java writing a hashtable with collision-managment.
So I tried to express my opinion that he won't get any java-code from here (I myself am hardly competent to give "working" java code 
|
|
|
|
|
Well, using Java is just one of his requirements. On the other hand this forum is focused on algorithms (hence is, to some level, language-independent), specifically C# language should have no privilege here.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
|
|
|
|
|
You are right on this - but I think this is a .net-"centric" forum and you will see mostly C#-code (or VB but never java - right?).
And I tried hinting at the basic points of a hashtable - but this concept is so simple that the hardest part will be implementing it!
|
|
|
|
|
OMG.
All these years I was under the impression that this was an VC++ only forum.
Glad that this is now sorted out
codito ergo sum
|
|
|
|
|
Well I think this is getting OT but one last remark:
of course you will find a lot of VC++ code here but a major part of articles and posts deals with .net - so I'm sorry if I hurt your feelings (yeah I know C++ is the only real thing - and all the nasty GC-noobs can kneel in the light of your superior coding-skills ) ....
|
|
|
|
|
CKnig wrote: but a major part of articles and posts deals with .net
perhaps because this site attracts a lot of inexperienced programmers... c# being a lot easier to learn, but difficult to do the master concepts, like writing a c# compiler or an os.... those we leave to those daring few c++ programmers who kept a few brain cells... 
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)
|
|
|
|
|
CKnig wrote: but I think this is a .net-"centric" forum and you will see mostly C#-code (or VB but never java - right?).
Probably pseudo-code (or no code at all) is more appropriate for this forum and no, I don't think it is .net centric (did you forget C/C++?).
CKnig wrote: And I tried hinting at the basic points of a hashtable - but this concept is so simple that the hardest part will be implementing it!
I think that is not a difficult task to implement a simple algorithm with a powerful language like Java.Do you really think that hashing is such a simple matter?
Have a look at [^].
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
|
|
|
|
|
CPallini wrote: I think that is not a difficult task to implement a simple algorithm with a powerful language like Java.Do you really think that hashing is such a simple matter?
Have a look at [^].
The only difficult part of a hash-table is creating a "good" hash-function.
The OP wanted to write a hashtable with collision-handling so I assumed that the "difficulty" in his task would be to link the "lists" with the "table" - and this is a simple task!
And bye the way: he suggest some college course or whatever and on this level it's the most basic things (just wait for the LR(1)-grammar questions )
|
|
|
|
|
CKnig wrote: This is a C#-forum
It is?
Steve
|
|
|
|
|
CKnig wrote: This is a C#-forum
Not, it is not. It is the Mathematics and Algorithms Forum 
"I guess it's what separates the professionals from the drag and drop, girly wirly, namby pamby, wishy washy, can't code for crap types." - Pete O'Hanlon
|
|
|
|
|
hey can anyone please telme which of the algorithms are implemented in MS Project 2003, w.r.t to scheduling purpose
|
|
|
|
|
Have you tried google? You might want to rephrase your question a bit.
"I guess it's what separates the professionals from the drag and drop, girly wirly, namby pamby, wishy washy, can't code for crap types." - Pete O'Hanlon
|
|
|
|
|
|
REBD wrote: point me somewhere where i can find such algorithms implemented in c#
Maybe google?
"I guess it's what separates the professionals from the drag and drop, girly wirly, namby pamby, wishy washy, can't code for crap types." - Pete O'Hanlon
|
|
|
|
|
 Hello everyone, i'm recently working on a multi-language tagging system named Lispeln. Which used NGram with backoff and smooth to identify languages. Now the project almost finished, and support 476 languages.
Anyone who interested it could visit:
http://lispeln.googlepages.com[^]
for details.
Since I'm focusing on algorithm, I use C#3.0 to implement that, although ASP.NET application may seemed a more practical solution for that. 
Suggestions and dicussions about that is welcomed.
Thx
We can only see a short distance ahead, but we can see there that needs to be done.
|
|
|
|
|
Ok you've made me curious. Did you do this by yourself? That's alot of work if you did, I couldn't even list the names of 476 languages let alone know them well enough to test a program like that.
Han Xiao wrote: Which used NGram with backoff and smooth to identify languages.
What does that mean in plain english? If you got the time maybe you should write an article about it, it sound pretty impressive if it works.
Mike
|
|
|
|
|
Thanks for your attention, Mike. Yes, just by myself. But with a lot of help of Unicode.org. While I used some unicode encoding pattern for an initial identifier. Fortunately, Unicode.org provides all this rules and information about encoding.
Just you've mentioned, ngram is a statistical language model that based on probability.
Sure, I don't have a proper test text for that. And on my site, http://lispeln.googlepages.com
I built 4 typical pragraph for a quick-test, you can visit and see that.
I'm now still working on optimizing the algorithm.
We can only see a short distance ahead, but we can see there that needs to be done.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
