Greatest Common Divisor (Euclidean Algorithm C++)
This piece of code can determine the GCD of two numbers by applying the euclidean algorithm recursively. // euclid.cpp : main […]
a technical blog
This piece of code can determine the GCD of two numbers by applying the euclidean algorithm recursively. // euclid.cpp : main […]
// numreverse.cpp : main project file. #include <iostream> #include <string> #include <fstream> #include <iomanip> //required to use setw() #include <cstdio> […]
Class Definition: #include <iostream> using namespace std; class linklist { private: struct node { int data; node *link; }*p; public: […]
#include using namespace std; void do_again(),direction(int ans); void option_1(),option_2(),option_3(),option_4(),option_5(),option_6(); int main() { do_again();//call do_again function, say goodbye to main until […]
/* * A function to convert a string into a float * Author: Danny Battison * Contact: gabehabe@hotmail.com */ #include […]
/* * A function to convert a string into an integer * Author: Danny Battison * Author: Kyle Turley http://www.kturley.com […]
This code is useful when you want to ignore unrecognized input. // Remember this and the next function for error trapping […]
/* * A function to convert a string into an integer * * by Kyle Turley http://www.kturley.com */ #include <string> […]