What's the fastest way to learn algorithms?
537833
Algorythms are very interesting, you should review them and create some examples on your own, or follow the ones given to make sure you understand them.
120252
Go here and learn yourself!!\n\nA great article:\n\nhttp://www.onecomputerguy.com/performance_tips.htm
730115
read KNUTH! that's a classic question.\nhe is the king of algorithms! He wrote the book!\n\n\nbasically sort a pre-sorted list.
671227
Algorithms,\nFormal Methods,\nComputational Geometry,\nComplexity theory,\nTemporal Logic, and ...
120342
To really hone your abilities I recommend looking over some of the programming contest problem archives.  They are on the level of a week-long programming assignment in college and teach a variety of different skills: working from problem description to solution, basic data structures, basic algorithms, testing exterme cases...\n\nBeing able to solve problems like these will prepare you for any challenge you will come across :-)\n\nI am also including a few links to C++ resources for you.\n\nGood luck :-)
969057
In mathematics and computing, an algorithm is a procedure (a finite set of well-defined instructions) for accomplishing some task which, given an initial state, will terminate in a defined end-state. The computational complexity and efficient implementation of the algorithm are important in computing, and this depends on suitable data structures.\n\nInformally, the concept of an algorithm is often illustrated by the example of a recipe, although many algorithms are much more complex; algorithms often have steps that repeat (iterate) or require decisions (such as logic or comparison). Algorithms can be composed to create more complex algorithms.\n\nThe concept of an algorithm originated as a means of recording procedures for solving mathematical problems such as finding the common divisor of two numbers or multiplying two numbers. The concept was formalized in 1936 through Alan Turing's Turing machines and Alonzo Church's lambda calculus, which in turn formed the foundation of computer science.\n\nMost algorithms can be directly implemented by computer programs; any other algorithms can at least in theory be simulated by computer programs. In many programming languages, algorithms are implemented as functions or procedures.
879427
buy a c programming book\nauthor name is E BALAGURUSWAMY\nhe has explained it from the very basics\neasy to understand.\nyou have a computer at home?\ninstall c programming in your computer and try out simple basic programmes given in the book\nthis will help you understand faster.
458053
Convex Hull: Quick Hull Algorithm\nhttp://nereida.deioc.ull.es/html/casiano/qhull.html\n\nVoronoi: Boundary Extraction\nhttp://cgm.cs.mcgill.ca/~godfried/teaching/projects.pr.98/sergei/project.html
691515
algorithms, data structures, computer organization
366295
practice, practice, practice! Experience is the best teacher. \n\nI've found that the best way is to write programs for other people. That way, you are challenged to try new things (web service, database connections, automation) that you might not have tried on your own.
251440
memorize simple rules and try to derive the hard ones from simple ones and then to be fast then memorize the diffucult rules.Trigonometry is simple if you know basic El-Cebir well
1167280
I have learned lots from here:\n\nhttp://abruzzo2000.com/course/\n\nNo need to download or buy anything!
1757
I studied serious math for 8 years now, even though I'm only a high school student. I even competed in IMO and have won a medal, yet I cannot give you the best algorithm to solve a problem. To solve a problem, you need experience. To reach the international level, you need to solve millions of problems(literally!). Only practice will give you the ability to solve any problems easily.
608077
1. plug in Ipod tune "I got rhythm" and play it on a loop.\n2. Take the converse of the algorithm and divde by the beta weight that accounts for the most various in the equation.\n3. Eat a sandwhich... this is hard!\n4. Load images and begin decompression process.\n5. Defragment any non-algorithim friendly data bits (or  kibbles)\n6. Drink an orange soda or something with some carbonation for god's sake (and call your mother)\n7. Plug is DVR-read/write and enjoy your freshly baked and only slightly compressed images.  Voila!
371525
1. Evaluate and understand the task in hand completely. Make sure there is no confusion.\n2. Write an algorithm in plain English (or language of your choice)\n3. Divide task into smaller computer related tasks (input/output, processing, conditions etc.)\n4. While distributing your task in smaller ones, try your best that they are finctionally independent. That is do not combine input and condition as one rather split them into two.\n5. It's better that you choose Heirarchical approach instead of a linear one because linear approach is easy to draw and mess up.\n\nRead the above twice so they become 10 guidelines.
319998
http://www.math.iitb.ac.in/resources/manuals/algorithms.html click d link to know. It may be helpful to u.
1159892
Sequential search:\n\nhttp://cprogramming.com/discussionarticles/sorting_and_searching.html