Algorithms in VB.NET
- Thread starter PROKA
- Start date
thenerd
Centurion
Algorithms have been depreciated in vb.net. You can only use them through the Microsoft.visualbasic.compatibility.algorithm namespace.
Please tell me nobody took that seriously..
Anyway, I don't really understand your question. An algorithm is just the way that you accomplish something. Algorithms aren't even (at least, don't have to be) shown as code.
Please tell me nobody took that seriously..
Anyway, I don't really understand your question. An algorithm is just the way that you accomplish something. Algorithms aren't even (at least, don't have to be) shown as code.
example of problems implementing the greedy alg. or the backtracking or I dunno ...
Something like this book : http://www.cambridge.org/catalogue/catalogue.asp?isbn=0521547652&qty=1
Something like this book : http://www.cambridge.org/catalogue/catalogue.asp?isbn=0521547652&qty=1
Last edited:
Nerseus
Danner
I'm a bit confused - wasn't your question asking for an article or book, and didn't you just provide a link to a book? Or did you mean to JUST ask for articles similar to that book (but free)?
-nerseus
-nerseus
neodammer
Centurion
A book on algorithms is like asking of a book on inovation with vb.net. Granted an algorithm as stated earlier is steps to a solution etc.. This is virutally any program with input/output characteristics that mostly but not always have a changing variable. This is not set in stone of course.
1. Cannot find any books related to Algorithms in .NET in local stores
2. Cannot order from the internet (don't own a credit card and I don't think they would send it to my country)
3. I'm interested in general techniques ( greedy,backtracking,permutations,sortings etc ) and in problems to implement those algorithms
so if you know any articles or some free e-books ... please post
2. Cannot order from the internet (don't own a credit card and I don't think they would send it to my country)
3. I'm interested in general techniques ( greedy,backtracking,permutations,sortings etc ) and in problems to implement those algorithms
so if you know any articles or some free e-books ... please post
thenerd
Centurion
That's because an algorithm can be shown in ANY programming language. So there's no need for a specific .NET algorithm book.
neodammer
Centurion
thenerd said:
Indeed. Algorithm is in essense innovation. Use your mind your not stupid. Think hard think twice and you will eventually think wise
Thats a saying I live by anyway. Besides Algorithm's are not just for code, I like to apply them to everyday living like whats your procedure to get yourself ready for work? Translate that into code (yes geeky but true) and there you have it. Id search the internet for a description of those specific ideas your looking for and maybe you'll get some example code of how it might be implemented. Books on algy's are usually just brain sparks that get your mind rolling. Unlike "Learn Hardcode in 24 hours 
" that gives you straight out syntax basically code these books are more for brainstorming etc..A simple Google search should do the trick for you. Skimming the top 5 hits I see what looks like an e-book, two sets of notes from two different Computer Science classes and a tutorial on backtracking algorithms. Granted, you are going to have to learn how to read psuedo code, but that is a skill you should have anyway -- VB is practically reading sentances anyway. The best way to procede would be to take the general algorithms and work them into VB.Net yourself. Of course if your're willing to shell out some money, I'm sure you can buy a specific book...
"Algorithms in VB.Net" doesn't really make sense -- as neodammer said, algoriths are, in essence, innovation. You can take just about any algorithm and put it into any language you want. The "Hello World" algorithm should prove that, but for something a little more heavy weight, how about an algorithm for sorting a list...quick sort is implimented in every laugnage with a list data structure? Cool.
Obviously there are a few exceptions. Backtracking, for example, is free in Prolog, but needs to be written explicity in just about every other language. Pi calculation algorithms may be more difficult in Java than they would be in Fortran...as fortran (as I recall, it's been a while) has infinite precision floating point values for free. Anyway, I think you get the point.
"Algorithms in VB.Net" doesn't really make sense -- as neodammer said, algoriths are, in essence, innovation. You can take just about any algorithm and put it into any language you want. The "Hello World" algorithm should prove that, but for something a little more heavy weight, how about an algorithm for sorting a list...quick sort is implimented in every laugnage with a list data structure? Cool.
Obviously there are a few exceptions. Backtracking, for example, is free in Prolog, but needs to be written explicity in just about every other language. Pi calculation algorithms may be more difficult in Java than they would be in Fortran...as fortran (as I recall, it's been a while) has infinite precision floating point values for free. Anyway, I think you get the point.
