lavantien

/*
Big Unsigned Integer Library (biguint).
Written by Tien La.

User can do anything with this library, since there, I don't have any responsibility about any damage that may occur.
For any question or suggestion, please email me at lavantien96@gmail.com or via Facebook: fb.com/cariyaputta
This library is mainly for demonstration but still quite optimized and pretty fast.

All functions in this library don't return value (except 'GMP' function), instead, they use references to speed things up.
The rule of these function is almost the same: first argument is the result of the function, except 'cmp' and 'wl'.

lavantien

// written by LaVanTien . You have all rights to use and modify this source code :)
// compiled with flag: -std=c++14
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
 
static vector<int> a, b, c; // 3 towers, start at 'a' and end at 'c'
static int num; // number of discs
static int sum = 0; // number of steps

lavantien

// Warning: Use at least a compiler which has support ISO C99 to compile the program
#include <stdio.h> // For using printf, scanf, puts and putchar
#include <stdlib.h> // For using malloc and free
#include <stdbool.h> // For using bool variable type
 
struct Node { // DO NOT TYPEDEF THIS!
    int data; // Data field
    struct Node *next; // Pointer to the next node, if this node is the last node, this pointer point to NULL
};
// "ll" stand for Linked List, "ins" stand for insert, "del" stand for delete, "beg" stand for begin, "pos" stand for position

lavantien

/*
Warning: The following application was written in ISO C++11 standard, so it may incompatible with older C++ standards
Compiled by GCC with -std=c++11 flag
*/
#include <iostream>
#include <string>
#include <fstream>
#include <cstdlib> // for using rand() and srand()
#include <ctime> // for using time()
 

lavantien

/*
LaVanTien Present:
Quick-Sort Break-Point Benchmark Program.
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
 
const char *FO = "C:\\Dev\\quicksort_choosingbreakpoint_benchmarks_result.txt"; // Path of Result file.
const int MAX = 1000000; // Maximum array's elements.

lavantien

// Sorting Algorithms Benchmarks v0.0
// Created by LaVanTien
// 02/01/2016 6:00 AM
// Compiled at C language - ISO C11
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <time.h>
#define TEMPSIZE 10000
 

lavantien

// Compile with std=c++11 or above to avoid conflict.
// gl_ : global variables.    us_ : user defined functions.    :: : access global variables.
// Tested! All modules work 100%.
#include <iostream>
#include <random>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>

lavantien

using System;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;

namespace TestCS
{
	class Program
	{
		static void Main(string[] args) {

lavantien

using System;
using System.Collections.Generic;
using System.Linq;
using System.Collections;

namespace TestCS
{
	class Program
	{
		static void Main(string[] args) {

lavantien

using System;
using System.Data.Common;
using System.Configuration;

namespace TestCS
{
	class Program
	{
		static void Main(string[] args) {
			string provider = ConfigurationManager.AppSettings["provider"];