This is a guide for beginners to get them started at using Recursion to solve problems that arise while programming. It contains EXTENSIVE comments and should be very user friendly. Anybody with questions may email me. Vote for me!
File List:
@PSC_ReadMe_2828_3.txt
1Kb
Recursion.cpp
2Kb
Similar code
A C++ implementation of the Levenshtein Distance
(Popularity: ) : The "Levenshtein distance" is a measure of the similarity between two strings, this algorithm is also refered to as "edit distance". The "Levenshtein distance" was named after the russian scientist "Vladimir Levenshtein", who has discovered it back in 1965. The ... A 3D clock, OpenGL
(Popularity: ) : This is a simple program to demonstrate OpenGL. It will show the time in 3d, with the gears rotating in real time. The red squares are the currently active numbers. It runs wery well, and please vote. Amazing C++ String Class
(Popularity: ) : This is a C++ string class i wrote to make using strings in C++ alot easier it is good to learn form and has many functions. I havn't implemented it with friend functions yet but i hope to soon. If ... LINE COMPILED COMPARISON BETWEEN MERGE SORT AND QUICK SORT
(Popularity: ) : Count the total number of line compiled using merge sort and quick sort. String Replacer
(Popularity: ) : The function "replace_string" included in this program will replace all occurence of a certain string by another one and the function "find_occurence" will count the number of occurence of a string in another string. Unlike most string replacer function,this one ... Vowel deleter - method01
(Popularity: ) : It omit/delete vowels in the inputted strings then it displays the remaining letters and counted vowels in the screens... Thanks . Palindrome-method
(Popularity: ) : It tells whether inputted strings are palindrome or not and then it displays the reverse words in the screen...Thanks Word Search
(Popularity: ) : This example will search through an edit box and find all the occurances of the entered query word. Good lesson on string manipulation.
Code Library
) : The "Levenshtein distance" is a measure of the similarity between two strings, this algorithm is also refered to as "edit distance". The "Levenshtein distance" was named after the russian scientist "Vladimir Levenshtein", who has discovered it back in 1965. The ...