C# Programming

2013-05-16T09:59:00.001-07:00

used in operatonal research LP(linear programming)
The Simplex Algorithm

Simplex method

Resolve using the Simplex Method the following problem:

Maximize	Z = f(x,y) = 3x + 2y
subject to:	2x + y ≤ 18
	2x + 3y ≤ 42
	3x + y ≤ 24
	x ≥ 0 , y ≥ 0

Are considerated the following phases:

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

namespace Simplex_Method
{
class simplex
{
int countslock;
int frow;
int fcol;
double[,] dt = { { 1, -8, -6, 0, 0, 0, 0 }, { 0, 2, 7, 1, 0, 100, 0 }, { 0, 1, 3, 0, 1, 50, 0 } };
double[] temprowdata1 ;

public simplex()
{

Console.WriteLine("the data is");
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 7; j++)
{
Console.Write( dt[i,j] + " ");
}
Console.WriteLine();
}
Console.WriteLine();
Console.WriteLine();
temprowdata1 = new double[dt.GetLength(1)];
aditioniteration();
//operation(dt);
//double[] tempdt = {30,20,50,15,10,100};
//ratiorow(tempdt);
// Console.WriteLine(dt.GetLength(0));
}
public string check_cons(string a)
{
countslock++;
if (a.Contains("<="))
{
return a.Replace("<", "+s" + countslock);
}
else if (a.Contains(">="))
{
return a.Replace(">", "-s" + countslock);
}
return "error";
}
public string[] dataextract(string a)
{

string[] data;
int dtcounter =0;
data = new string[a.Length];
string sec = "";
for (int i = 0; i <a.Length; i++)
{

if (a[i] != 'x')
{
sec += a[i];
}
else { i++;
data[dtcounter] = sec; dtcounter++; sec = ""; }

}
data[dtcounter] = sec;
for (int i = 0; i <data.Length; i++)
{
if (data[i] != null)
{
if (data[i].Length == 1 && i > 0 )
{ data[i] += "1"; }
if (data[i].Contains("="))
{

string[] s = data[i].Split('=');
bool ass = false;
foreach (var item in s)
{
if (ass)
{ data[i + 1] = item; }
if (item.Contains('-'))
{ data[i] = "-1"; ass = true; }
else if(!item.Contains('-') && !ass) { data[i] = "1"; ass = true; }
}
}
}

}
//for (int i = 0; i < data.Length; i++)
//{
// Console.WriteLine(data[i]);
//}

return data;
}

public void problemsolve(double[,] a)
{
if (minind(a) > 0)
{

}
}

public double[] operation(double[,] a)
{
int row = 0;
int coloumn = 0;
double pivotelement = 0;
double m = 0;
double[] ratiodata = new double[a.GetLength(0)];
bool readytogo = false;
for (int i = 0; i < a.GetLength(0); i++)
{
//least data containg coloumn index
if (a[0, i] < m)
{
m = a[0, i];
coloumn = i;
}
}
if (readytogo)
{
for (int i = 1; i < a.GetLength(0); i++)
{
//least ratio calculating
ratiodata[i] = (a[i, a.GetLength(1) - 2] / a[i, Convert.ToInt32(coloumn)]);
}

//selecting row data for next operation to bring zero in data one
if (minratiocheck(ratiodata))
{
double[] temprowdata = new double[a.GetLength(1)];

row = ratiorow(ratiodata);
pivotelement = a[row, coloumn];

if (pivotelement > 0 && pivotelement == 1)
{
// if pivot = 1 take data as it
for (int i = 0; i < a.GetLength(1); i++)
{
temprowdata1[i] = (a[row, i]);
Console.WriteLine(temprowdata[i]);
}
}
else
{
//pivot element row equalizing to one and then take data
for (int i = 0; i < a.GetLength(1); i++)
{
temprowdata1[i] = (a[row, i] / a[row, coloumn]);
}

}
}
frow = row;
fcol = coloumn;
return temprowdata1;
}
}
public void aditioniteration()
{
double[] arr = operation(dt);
double[] arrtemp = new double[arr.Length];
double leastvalue = dt[0, fcol];
for (int i = 0; i <arr.Length; i++)
{
arrtemp[i] = arr[i] * (leastvalue *(-1));
Console.WriteLine(arrtemp[i]);
}
}
public bool minratiocheck(double[] ratio)
{
for (int i = 0; i < ratio.Length; i++)
{
if (ratio[i] > 0)
{
return true;
}
}
return false;
}
public int ratiorow(double[] ratio)
{
double m =500000000;
int row = 0;
for (int i = 0; i < ratio.Length; i++)
{
if (m > ratio[i] && ratio[i] != 0)
{
if (ratio[i] > 0)
{
m = ratio[i];
row = i;
}

}

}
return row;
}
public double minind(double[,] a)
{
double m = 0;
double ind = 0;
for (int i = 0; i < a.GetLength(0); i++)
{
if (a[0, i] < m)
{
m = a[0, i];
ind = i;
}
}
if (ind > 0)
{
return ind;
}
return 0.0;
}
public void ratiocheck(double[,] a)
{
double minvalue = minind(a);
double[] ratiodt = new double[a.GetLength(0)];

Console.WriteLine("minvalue " + minvalue);
for (int i = 1; i < a.GetLength(0); i++)
{
ratiodt[i] = a[i, Convert.ToInt32(minvalue)] / a[i, a.GetLength(1) - 2];
Console.WriteLine(ratiodt[i]);
Console.WriteLine(a[i, a.GetLength(1) - 1]+" world war");
}
}
}
class Program
{

static void Main(string[] args)
{
simplex sim = new simplex();

/*

int[] arr = { 0, 0,50, 50, 60 ,-90,0,0,10,10,20};
int m = 1000000;
for (int i = 1; i < arr.Length; i++)
{
if (m > arr[i] && arr[i] != 0 )
{
if (arr[i] > 0)
{
m = arr[i];
Console.WriteLine(m);
Console.WriteLine(i);
}
}
}
important min function
*/
/*
// sim.dataextract("");
string[] constraint = { "20x1-10x2+0x3>=50", "1x1+3x2+x3>=25", "-1x1+2x2+0x3<=26" };
//for (int i = 0; i < constraint.Length; i++)
//{

// string[] values = sim.dataextract(sim.check_cons(constraint[i]));

// foreach (var item in values)
// {
// if (i >= 1)
// {
// Console.Write(item + " ");
// }
// Console.WriteLine();

// }

//}

//string maxz = "Z=2x1+3x2+4x3";
//maxz = maxz.Replace("+", "-");
//maxz = maxz.Replace("=", "-");
//maxz += "=0";
//Console.WriteLine(maxz);

for (int i = 0; i < constraint.Length; i++)
{
// Console.WriteLine(sim.check_cons(constraint[i]));
string[] values = sim.dataextract(sim.check_cons(constraint[i]));
foreach (var item in values)
{
Console.Write(item + " ");
}
Console.WriteLine();
}
Console.WriteLine("refind data");
sim.dataextract("90x1-7x2+1x3-s2=25");
*/
}
}
}

Android simple application by adding 2 values

2013-05-16T09:52:00.001-07:00

ok this is csharp blog and quit inactive for a long time i have been not posting any thing about c-sharp and that is because i don't much work to do on c-sharp for. but main purpose of this is blog is online codes for programming whether its c-sharp or java or android.
so today i am going to post the complete code of a little android test application.

XML

<?xml version="1.0" encoding="utf-8"?>
<AbsoluteLayout android:id="@+id/widget0"
android:layout_width="fill_parent"
android:layout_height="fill_parent"
xmlns:android="http://schemas.android.com/apk/res/android">
<TextView android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:text="ADDITION OF NUMBERS"
android:id="@+id/textView1"
android:layout_x="73dip"
android:layout_y="28dip"></TextView>
<TextView android:layout_width="wrap_content"
android:layout_x="36dip"
android:layout_height="wrap_content"
android:text="First Amount"
android:id="@+id/textView2"
android:layout_y="80dip"></TextView>
<EditText android:text=""
android:layout_width="wrap_content"
android:layout_x="172dip"
android:id="@+id/amount1"
android:layout_height="wrap_content"
android:layout_y="62dip"></EditText>
<TextView android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:text="Second Amount"
android:id="@+id/textView3"
android:layout_x="36dip"
android:layout_y="169dip"></TextView>
<EditText android:text=""
android:layout_width="wrap_content"
android:layout_x="169dip"
android:id="@+id/amount2"
android:layout_height="wrap_content"
android:layout_y="152dip"></EditText>
<Button android:layout_width="wrap_content"
android:id="@+id/calculate"
android:layout_x="41dip"
android:layout_height="wrap_content"
android:text="Calculate"
android:layout_y="232dip"></Button>
<EditText android:text=""
android:layout_width="wrap_content"
android:layout_x="172dip"
android:id="@+id/tt"
android:layout_height="wrap_content"
android:layout_y="232dip"></EditText>
</AbsoluteLayout>

Main Activity

package com.example.test;

import android.os.Bundle;

import android.app.Activity;

import android.view.View;

import android.widget.Button;

import android.widget.EditText;

import android.widget.TextView;

public class MainActivity extends Activity {

EditText amount1;

EditText amount2;

TextView tt;

Button calculate;

double x=0;

double y=0;

double z=0;

/** Called when the activity is first created. */

@Override

public void onCreate(Bundle savedInstanceState)

{

super.onCreate(savedInstanceState);

setContentView(R.layout.activity_main);

initControls();

}

private void initControls()

{

amount1=(EditText)findViewById(R.id.amount1);

amount2=(EditText)findViewById(R.id.amount2);

tt=(TextView)findViewById(R.id.tt);

calculate=(Button)findViewById(R.id.calculate);

calculate.setOnClickListener(new Button.OnClickListener(){public void onClick

(View v) { calculate();}});

}

private void calculate()

{

x=Double.parseDouble(amount1.getText().toString());

y=Double.parseDouble(amount2.getText().toString());

z=x+y;

tt.setText(Double.toString(z));

calculate.setText(Double.toString(z));

}

Database connectivity.

2012-11-30T00:46:00.000-08:00

Connection string for Sql and msacces

SQL connection string:Data Source=(local) ;Initial Catalog=myDataBase.mdb ;Integrated Security=SSPI;
MSacces connection string (2003): Provider=Microsoft.Jet.OLEDB.4.0;Data Source=C:\mydatabase.mdb;
MSacces connection string (2007): Provider=Microsoft.ACE.OLEDB.12.0;Data Source=C:\mydatabase.mdb;

Sample code Sql:

using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Windows.Forms;
using System.Data.SqlClient;

namespace database_manupulation
{
    public partial class Form1 : Form
    {
        public string constring = "Data Source=TAHMED\\SQLEXPRESS;Initial Catalog=hospital;Integrated Security=TRUE";
        bool max = true;
        bool min = false;
        SqlConnection con = new SqlConnection("Data Source=(local) ;Initial Catalog=hospital;Integrated Security=TRUE");
        SqlDataAdapter da = new SqlDataAdapter();
        DataSet ds = new DataSet();
        public Form1()
        {

            InitializeComponent();
            timer1.Start();
        }

        private void button1_Click(object sender, EventArgs e)
        {

            da.SelectCommand = new SqlCommand("SELECT * FROM patient", con);
            ds.Clear();
            da.Fill(ds);
            dataGridView1.DataSource = ds.Tables[0];

        }

        private void button2_Click(object sender, EventArgs e)
        {
            try
            {
                da.InsertCommand = new SqlCommand("INSERT INTO patient VALUES(@patient_name,@phy_id)", con);
                //da.InsertCommand = new SqlCommand("INSERT INTO treatment VALUES(@patient_id,@phy_id)", con);

                da.InsertCommand.Parameters.Add("@patient_name", SqlDbType.VarChar).Value = textBox1.Text;

                //da.InsertCommand.Parameters.Add("@phy_id", SqlDbType.Int).Value = Convert.ToInt32(textBox2.Text);

                //da.InsertCommand.Parameters.Add("@patient_id", SqlDbType.Int).Value = Convert.ToInt32(textBox3.Text);

                da.InsertCommand.Parameters.Add("@phy_id", SqlDbType.Int).Value = Convert.ToInt32(textBox2.Text);

                con.Open();
                da.InsertCommand.ExecuteNonQuery();
                con.Close();
            }
            catch (Exception v)
            {
                con.Close();
                MessageBox.Show(v.Message);
            }
        }

        private void button3_Click(object sender, EventArgs e)
        {
            da.DeleteCommand = new SqlCommand("DELETE FROM patient WHERE patient_id="+Convert.ToInt32( textBox2.Text), con);
          // da.DeleteCommand = new SqlCommand("DELETE FROM treatment WHERE treatment_id=" +Convert.ToInt32( textBox2.Text), con);

            con.Open();
            da.DeleteCommand.ExecuteNonQuery();
            con.Close();
        }

        private void timer1_Tick(object sender, EventArgs e)
        {
           label2.Text = Convert.ToString( DateTime.Now.ToUniversalTime());
            //label2.Text = DateTime.Now.ToLongTimeString();
        }

        private void button4_Click(object sender, EventArgs e)
        {
           //dataGridView2.Columns.Add("this", "THIS");
          // dataGridView2.Rows.Add("THis", 3);
            double a = Convert.ToDouble(dataGridView2.Rows[0].Cells[1].Value.ToString());
            double b = Convert.ToDouble(dataGridView2.Rows[1].Cells[1].Value.ToString());
            double c = Convert.ToDouble(dataGridView2.Rows[2].Cells[1].Value.ToString());
            double d = Convert.ToDouble(dataGridView2.Rows[3].Cells[1].Value.ToString());
            double aa = Convert.ToDouble(dataGridView2.Rows[4].Cells[1].Value.ToString());
            double zz = a + b +c+d+aa;
            ///dataGridView2.Columns.Add("1", "want check");
            label3.Text = (zz/5).ToString();
        }

        private void dataGridView2_CellContentClick(object sender, DataGridViewCellEventArgs e)
        {
            //DataTable dt = new DataTable();
            //dt.Columns.Add("this");
            //DataRow a = dt.NewRow();
            //a[1] = "this and no regret";
            //label3.Text = a[1].ToString();
        }

        private void button5_Click(object sender, EventArgs e)
        {

            if (max)
            {
                this.WindowState = FormWindowState.Maximized;
                min = true;
                max = false;
            }
            else { this.WindowState = FormWindowState.Normal; max = true; min = false;}

            //dataGridView2.Rows.Clear();
        }

        private void Form1_Load(object sender, EventArgs e)
        {
            dataGridView2.Rows.Add();
            dataGridView2.Rows[0].Cells[0].Value = "user";
            dataGridView2.Rows[0].Cells[1].Value = "3.5";
            dataGridView2.Rows[0].Cells[2].Value = "good";
            toolStripProgressBar1.Value = 20;
dataGridView2.Rows.Add();
            dataGridView2.Rows[1].Cells[0].Value = "user";
            dataGridView2.Rows[1].Cells[1].Value = "4";
            dataGridView2.Rows[1].Cells[2].Value = "good";
            toolStripProgressBar1.Value = 40;
            dataGridView2.Rows.Add();
            dataGridView2.Rows[2].Cells[0].Value = "user";
            dataGridView2.Rows[2].Cells[1].Value = "3";
            dataGridView2.Rows[2].Cells[2].Value = "good";
            toolStripProgressBar1.Value = 60;
            dataGridView2.Rows.Add();
            dataGridView2.Rows[3].Cells[0].Value = "user";
            dataGridView2.Rows[3].Cells[1].Value = "2.5";
            dataGridView2.Rows[3].Cells[2].Value = "good";
            toolStripProgressBar1.Value = 80;
            dataGridView2.Rows[4].Cells[0].Value = "user";
            dataGridView2.Rows[4].Cells[1].Value = "1.5";
            dataGridView2.Rows[4].Cells[2].Value = "good";
            toolStripProgressBar1.Value = 100;
            toolStripStatusLabel1.Text = "data loaded to datagrid view";
        }

        private void statusStrip1_ItemClicked(object sender, ToolStripItemClickedEventArgs e)
        {
            toolStripStatusLabel1.Text = "windows color red";
            toolStripProgressBar1.Value = 0;
            this.BackColor = Color.Red;
        }
    }
}

2012-05-13T10:20:00.001-07:00

Des cipher with 10 bit key generator. complete algo and program with source code

Screen shot of Des cipher GUI program

Source code will be Available .

https://docs.google.com/open?id=0B_GqGJH_ajS9YlFPaWRvY2xEYkk

2011-12-28T06:42:00.000-08:00

Algorithm's

Tower of Hannoi
Gaussian Elimination
Matrix Multiplication
Jhon trotter(permutation)
Lexographic (permutation)

ALGORITHM TOWER OF HANOI as TOH (n,A,B,C)

{

//if only one disk has to moved

If(n=1) then

{

Write(“The peg moved from A to C”)

Return

}

else

{

//move top (n-1) disk from A to B using C

TOH(n-1,A,B,C)

// move remaining disk from B to C using A

TOH(n-1,B,C,A)

}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace algorithms

{

class algo

{

int count;

public void towerofhannoi(int n,char w,char y,char z)

{

count++;

if (n == 1)

{

Console.WriteLine("disc moved from {0} to {1} using {2}", w,y,z);

}

else

{

towerofhannoi(n - 1, w,y,z);

towerofhannoi(1, w, z,y);

towerofhannoi(n - 1, y ,z, w );

}

class Program

{

static void Main(string[] args)

{

algo hanoi = new algo();

hanoi.towerofhannoi(3,'A', 'B' ,'C');

}

Gauss jordan row elimination algorithm:

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace new_algo

{

class algo

{

int[,] a;

int tnum;

public algo(int no)

{

tnum = no;

a = new int[tnum, tnum + 1];

}

public void show()

{

Console.WriteLine("enter the value");

for (int i = 0; i < tnum; i++)

{

for (int j = 0; j < tnum + 1; j++)

{

Console.Write("M[{0},{1}]=", i, j);

a[i, j] = Convert.ToInt32(Console.ReadLine());

}

//a[i, a.GetLength(0)] = b[i];

}

Console.WriteLine("Displaying the values in Matrix");

for (int i = 0; i < tnum; i++)

{

for (int j = 0; j < tnum + 1; j++)

{

Console.Write("{0:F2}\t",a[ i, j]);

}

Console.WriteLine();//a[i, a.GetLength(0)] = b[i];

}

for (int i = 0; i < tnum; i++) // i representing no of rows

{

int temp = a[i, i];

for (int j = 0; j < tnum + 1; j++) // j representing no of columns

{

a[i, j] = a[i, j] / temp; // To Store Multipliers

}

for (int k = 0; k < tnum; k++) // k representing Rows on which operation is

{ // being performed. To create zeros below &

temp = a[k, i]; // above the main diagonal.

if (i != k)

{

for (int j = 0; j < tnum + 1; j++) // j represents no of colums on which operation is being performed

{

a[k, j] = a[k, j] - (temp * a[i, j]);

}

Console.WriteLine("solved matrix");

for (int i = 0; i < tnum; i++)

{

for (int j = 0; j < tnum + 1; j++)

{

Console.Write("{0:F2}\t", a[i, j]);

}

Console.WriteLine();//a[i, a.GetLength(0)] = b[i];

}

class Program

{

static void Main(string[] args)

{

algo a = new algo(2);

a.show();

}

MATRIX MULTIPLICATION ALGORITHM ON N*N ARRAYS

ALGORITHM MATRIX MULTIPLICATION (A[0…n-1], B[0…n-1])

//Multiplying two n*n matrices by the definition base algorithm

//Input: Two n*n matrices A and B

//Output: matrix C=A*B

For i<----0 to n-1 do

For j<----0 to n-1 do

C[i,j] <----0

For k<----0 to n-1 do

C[i,j] <---- C[i,j]+A[i,k]*B[k,j]

return C

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace algorithms

{

class Program

{

static void Main(string[] args)

{

int[,] a = new int[,]{{1,3,4},{6,2,4}};

int[,] b = new int[,]{{5,4,8},{3,2,7}};

int[,] c = new int[, ] {{5,4,8},{3,2,7}};

for (int i = 0; i < c.GetLength(0); i++)

{

for (int j = 0; j < c.GetLength(1); j++)

{

c[i, j] = 0;

for (int k = 0; k < b.GetLength(0); k++) // OR k<b.GetLength(0)

c[i, j] = c[i, j] + a[i, k] * b[k, j];

}

for (int row = 0; row < c.GetLength(0); row++)

{

for (int col = 0; col < c.GetLength(1); col++)

{

Console.WriteLine("{0}",c[row, col]);

Console.WriteLine();

}

Jhon trotter algorithm()

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace algo

{

public class JT

{

public void perm(int N)

{

int[] p = new int[N]; // permutation

int[] pi = new int[N]; // inverse permutation

int[] dir = new int[N]; // direction = +1 or -1

for (int i = 0; i < N; i++)

{

dir[i] = -1;

p[i] = i;

pi[i] = i;

}

perm(0, p, pi, dir);

Console.Write(" (0 1)\n");

}

public void perm(int n, int[] p, int[] pi, int[] dir)

{

if (n >= p.Length)

{

for (int i = 0; i < p.Length; i++)

Console.Write(p[i]);

return;

}

perm(n + 1, p, pi, dir);

for (int i = 0; i <= n - 1; i++)

{

// swap

Console.Write(" {0} {1}\n", pi[n], pi[n] + dir[n]);

int z = p[pi[n] + dir[n]];

p[pi[n]] = z;

p[pi[n] + dir[n]] = n;

pi[z] = pi[n];

pi[n] = pi[n] + dir[n];

perm(n + 1, p, pi, dir);

}

dir[n] = -dir[n];

}

class Program

{

static void Main(string[] args)

{

JT a = new JT();

Console.Write("Enter value:");

int x = Convert.ToInt32(Console.ReadLine());

a.perm(x);

}

Lexicographic algorithm ()

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace algo

{

public class PermutationsLex

{

public void show(int[] a)

{

for (int i = 0; i < a.Length; i++)

Console.Write("{0}", a[i]);

Console.WriteLine("\n");

}

public void swap(int[] a, int i, int j)

{

int temp = a[i];

a[i] = a[j];

a[j] = temp;

}

public bool hasNext(int[] a)

{

int N = a.Length;

// find rightmost element a[k] that is smaller than element to its right

int k;

for (k = N - 2; k >= 0; k--)

if (a[k] < a[k + 1]) break;

if (k == -1) return false;

// find rightmost element a[j] that is larger than a[k]

int j = N - 1;

while (a[k] > a[j])

j--;

swap(a, j, k);

for (int r = N - 1, s = k + 1; r > s; r--, s++)

swap(a, r, s);

return true;

}

public void perm(int N)

{

// initialize permutation

int[] a = new int[N];

for (int i = 0; i < N; i++)

a[i] = i;

// print permutations

show(a);

while (hasNext(a))

show(a);

}

class Program

{

static void Main(string[] args)

{

PermutationsLex a = new PermutationsLex();

Console.Write("Enter value:");

int x = Convert.ToInt32(Console.ReadLine());

a.perm(x);

}

Sql Sample Databases

2011-12-18T10:33:00.001-08:00

Adventurework sample database
Northwind sample database
PUBS sample database

click the folder and you can download these sample data bases for you sql server.

GCD (greatest common deviser) Consecutive integers and Uclide method

2011-10-30T00:16:00.001-07:00

Algorithm to find GCD (greatest common deviser)

Consecutive integers and Uclide method

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace algorithm

{

class GCDalgos

{

int t;

int r;

int size;

public GCDalgos() { }

//computer gcd of m and n value by uclide method

//input: two non-negative integers and non zero

//output: the greates common diviser of m and n value

public int uclide(int _m,int size)

{

if (size > _m)

{

int temp = size;

size = _m;

_m = temp;

}

if (size == 0 || size ==1)

{ Console.WriteLine("the GCD By uclid is: {0}",_m);}

else

{

r = _m % size;

_m = size;

size = r;

uclide(_m, size);

}

return 0;

}

//computer gcd by consecutive integer method of m and n

//input: two non-negative integers and non zero

//output: the greates common diviser of m and n value

public int consecutiveinteger(int m, int n)

{

//if (m == 0 || n == 0) { return m; }

if (m < n)

{

t = m;

}

else

{

t = n;

}

while (t != 1)

{

if (m % t == 0)

{

if (n % t == 0)

{

return t;

}

t = t - 1;

}

else t = t-1;

}

return m;

}

class Program

{

static void Main(string[] args)

{

GCDalgos a = new GCDalgos();

Console.WriteLine("Enter value of m");

int n = Convert.ToInt32(Console.ReadLine());

Console.WriteLine("Enter value of n");

int m = Convert.ToInt32(Console.ReadLine());

a.uclide(m, n);

Console.WriteLine("The GCD by Consecutive integer is: {0}", a.consecutiveinteger(m, n));

Console.Read();

}

Algorithm to find GCD (greatest common deviser) Primary school GCD method

2011-10-30T00:15:00.000-07:00

Algorithm to find GCD (greatest common deviser)

Primary school GCD method

//computer gcd of m and n value by primary school method

//input: two non-negative integers and non zero and array m & n //of n size

//output: the greates common diviser of m and n value

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace sieve

{

class algo

{

int n,j;

int[] arr;

int[] l;

int[] m;

int[] _n;

public algo() { }

public algo(int _m)

{

n = _m + 1;

arr = new int[n];

l = new int[n];

m = new int[n];

_n = new int[n];

}

public void sievealgo()

{

for (int p = 2; p < n; p++)

{

arr[p] = p;

}

for (int p = 2; p < Math.Sqrt(n) ; p++)

{

if (arr[p] != 0)

{

j = p * p;

}

while (j <= n-1)

{

arr[j] = 0;

j += p;

}

int i = 0;

for (int a = 0; a < n; a++)

{

if (arr[a] != 0)

{

l[i] = arr[a];

i++;

}

for (int p = 0; p < n; p++)

{

if (l[p] != 0)

Console.WriteLine(l[p]);

}

public void primegcd(int _m,int nn)

{

int valuem = _m;

int d=0,st=0;

while (valuem != 1 && l[st] != 0)

{

if (valuem % l[st] == 0 )

{

m[d] = l[st];

valuem = valuem / l[st];

st = 0;

d++;

}

else st++;

}

int valuenn = nn;

int dd = 0, stt = 0;

while (valuenn != 1 && l[stt] != 0)

{

if (valuenn % l[stt] == 0)

{

_n[dd] = l[stt];

valuenn = valuenn / l[stt];

stt = 0;

dd++;

}

else stt++;

}

for (int p = 0; p < n; p++)

{

if(_n[p] != 0 || m[p]!=0)

Console.WriteLine("m= {0}\t n= {1}",m[p],_n[p]);

}

int gcd=1;

int i = 0;

while(m[i] != 0)

{

for (int j = 0; j < n; j++)

{

if (_n[j] == m[i] && m[i] != 0)

{

gcd =gcd * _n[j];

_n[j] = 0;

m[i] = 0;

}

i++;

}

Console.WriteLine("vale m= {0}\t value n={1}", _m, nn);

Console.WriteLine("gcd {0}", gcd);

}

class Program

{

static void Main(string[] args)

{

algo a = new algo(32);

a.sievealgo();

Console.WriteLine("seprator");

a.primegcd(150,154);

}

Count Sort Complete Code.

2011-10-23T00:27:00.000-07:00

Count Sort Complete Code.

Counting Sort Program

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace COUNT_SORT

{

    class sorting

    {

        int n;

        int[] cs;

        int[] count;

        int[] s;

        public sorting() { }

        public sorting(int _n)

        {

            n = _n;

            cs = new int[n];

            count = new int[n];

            s = new int[n];

        }

        public void Countsort()

        {

            Console.WriteLine("Enter The value you want sort");

            for (int i = 0; i < n; i++)

            {

                cs[i] = Convert.ToInt32(Console.ReadLine());

            }

            for (int i = 0; i < n; i++)

            {

                count[i] = 0;

            }

            for (int i = 0; i < n - 1; i++)

            {

                for (int j = i + 1; j < n; j++)

                {

                    if (cs[i] < cs[j])

                    { count[j]++; }

                    else { count[i]++; }

              }

            }

            for (int i = 0; i < n; i++)

            {



                for (int j = 0; j < n; j++)

                {

                    Console.Write(s[j]);

                }

                Console.WriteLine();

                s[count[i]] = cs[i];

            }

            for (int j = 0; j < n; j++)

            { Console.Write(s[j]); }

            Console.WriteLine();

            Console.ReadLine();

        }

    }

    class Program

    {

        static void Main(string[] args)

        {

            sorting s = new sorting(10);

            s.Countsort();

        }

    }
}

General Tree Data Structure.

2011-10-22T12:22:00.000-07:00

General Tree Data Structure.

Each node at at right including root node is a parent node

& node that will be added at left will be the child node.

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace Genreal_tree_node

{

class bst_node

{

public int id;

public bst_node left, right;

public bst_node()

{

id = 0;

left = right = null;

}

public bst_node(int id1)

{

id = id1;

left = right = null;

}

class binarytree

{

bst_node root;

bst_node parent;

bst_node temp;

public binarytree()

{ parent = temp = root = null; }

public void inserhelper(int id)

{

insertnode(id, ref root);

}

private void insertnode(int id, ref bst_node r)

{

if (r == null)

r = new bst_node(id);

else if (id < r.id)

insertnode(id, ref r.left);

else if (id > r.id)

insertnode(id, ref r.right);

else Console.WriteLine("Same data not allowed");

}

public void inordertraversehelper()

{

inordertravers(root);

}

private void inordertravers(bst_node r)

{

if (r != null)

{

inordertravers(r.left);

Console.WriteLine(r.id);

inordertravers(r.right);

}

public void maximno()

{

bst_node temp = root;

while (temp != null)

{

temp = temp.right;

if (temp == null)

{

break;

}

Console.WriteLine(temp.id);

}

public void minimum()

{

bst_node temp = root;

while (temp != null)

{

temp = temp.left;

if (temp == null)

{

break;

}

Console.WriteLine(temp.id);

}

public void searchhelper(int a)

{

sesarch(a,ref root);

}

private void sesarch(int a, ref bst_node r)

{

if (r != null)

{

if (a == r.id)

{

parent = r;

}

sesarch(a, ref r.left);

sesarch(a, ref r.right);

}

public void genrealtreeinsert()

{

int a,b;

if (root == null)

{

Console.WriteLine("Enter the value of parent\n");

a = Convert.ToInt32(Console.ReadLine());

root = new bst_node(a);

Console.Write("How much child root should have\n");

int c = Convert.ToInt32(Console.ReadLine());

Console.WriteLine("Enter the value of Child");

b = Convert.ToInt32(Console.ReadLine());

temp = root.left = new bst_node(b);

while (c != 1)

{

Console.WriteLine("Enter the value of Child\n");

b = Convert.ToInt32(Console.ReadLine());

temp.right = new bst_node(b);

temp = temp.right;

c--;

}

else

{

childadder();

}

private void childadder()

{

int a, b;

Console.WriteLine("*****At which node do you want add child******");

a = Convert.ToInt32(Console.ReadLine());

sesarch(a, ref root);

if (parent.left == null)

{

Console.Write("How much child root should have");

int c = Convert.ToInt32(Console.ReadLine());

Console.WriteLine("Enter the value of Child");

b = Convert.ToInt32(Console.ReadLine());

temp = parent.left = new bst_node(b);

while (c != 1)

{

Console.WriteLine("Enter the value of Child");

b = Convert.ToInt32(Console.ReadLine());

temp.right = new bst_node(b);

temp = temp.right;

c--;

}

else

{

Console.WriteLine("Node alredy contain child");

Console.WriteLine("DO YOU WANT OVERWRITE\nPress y to overwrite");

string check = Console.ReadLine();

if (check == "y" || check == "y")

{

parent.left = null;

childadder();

}

class Program

{

static void Main(string[] args)

{

binarytree tree = new binarytree();

Console.WriteLine("-----------------");

tree.genrealtreeinsert();

Console.WriteLine("-----------------");

//tree.searchhelper(4);

Console.WriteLine("-----------------");

tree.inordertraversehelper();

}

DOUBLY LINKEDLIST

2011-10-22T11:58:00.000-07:00

DOUBLY LINKEDLIST

Code in Csharp

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace doubly_link

{

class dnode

{

public int id;

public string name;

public dnode next;

public dnode prev;

public dnode()

{

id = 0;

name = "";

next = null;

prev = null;

}

public dnode(dnode n)

{

this.id = n.id;

this.name = n.name;

next = null;

prev = null;

}

public dnode(string nam, int id1)

{

name = nam;

id = id1;

next = null;

prev = null;

}

class dlink_list

{

dnode head, temp,curr;

public dlink_list()

{

curr=head = temp = null;

}

public void insert(dnode n)

{

dnode a = head;

if (head == null)

{

curr=head =temp = new dnode(n);

}

else

{

temp = curr;

curr = new dnode(n);

temp.next = curr;

curr.prev = temp;

}

public void showforward()

{

dnode a = head;

while (a!= null)

{

Console.WriteLine("name is:{0} \t id is:{1}", a.name, a.id);

a = a.next;

}

public void showbackward()

{

dnode a = curr;

while (a != null)

{

Console.WriteLine("Name is:{0} \tId is:{1}", a.name, a.id);

a = a.prev;

}

public void deletef()

{

//dnode b;

head = head.next;

head.prev = null;

}

public void insertfirst(dnode n)

{

dnode t = new dnode(n);

t.next = head;

head.prev = t;

head = t;

// t.prev = head;

}

class Program

{

static void Main(string[] args)

{

dlink_list a = new dlink_list();

a.insert(new dnode("thor",23));

a.insert(new dnode("true", 75));

a.insert(new dnode("Hamer", 7));

a.insert(new dnode("kahn", 23));

a.insertfirst(new dnode("cham", 34));

// a.deletef();

a.showforward();

Console.WriteLine("-------------------------");

Console.WriteLine("After deleted first");

Console.WriteLine("-------------------------");

a.deletef();

a.showbackward();

Console.WriteLine("-------------------------");

}

Introduction To Design And Analysis Of Algorithms,by Anany levitin

2011-09-10T06:22:00.000-07:00

The book by: Anany Levitin

C# Operator overloading

2011-09-01T01:57:00.000-07:00

Whenever you overload an operator in C#, you have specific operator methods created that are related to the operator that you overload. Hence, when you overload the + operator, the overloaded operator method name is operator+. Note that all the overloaded operator methods are named "operator." Further, all operator methods in C# are static.

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace weight

{

class weight

{

int kg;

int mg;

public weight()

{ }

public weight(int a, int b)

{

kg = a;

mg = b;

}

public void get_w()

{

Console.WriteLine("Enter the kilogram Object 2");

kg = Convert.ToInt32(Console.ReadLine());

Console.WriteLine("Enter the miligram Object 2");

mg = Convert.ToInt32(Console.ReadLine());

}

public void display()

{

Console.WriteLine("kilograms are {0} \nMile grams are {1}", kg, mg);

}

public static weight operator+(weight h1, weight h2)

{

int Kg, Mg;

Kg = h1.kg + h2.kg;

Mg = h1.mg + h2.mg;

if (Mg >= 1000)

{

Kg++;

Mg -= 1000;

}

else { }

weight h3 = new weight(Kg, Mg);

return h3;

}

static void Main(string[] args)

{

weight w1 = new weight(5, 600);

weight w2 = new weight();

w2.get_w();

w2.display();

w1.display();

weight w3 = w1 + w2;

w3.display();

}

Output

}

Bubble sort with dry run

2011-08-29T06:18:00.000-07:00

Bubble sort dry run. with all steps how bubble sort work. you can count exchange and comparisons also by adding counter in this code. basic and simple code of the bubble sort in c#.

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

namespace sorting_algo_s
{
class salgos
{
int[] arr = new int[10];
public void getdata()
{
Console.WriteLine("inter value of array");
//arr = new int[10];
for (int i = 0; i < 10; i++)
{
arr[i] = Convert.ToInt32(Console.ReadLine());
}
}
public void bubblesort()
{
for (int i = 0 ; i < 10; i++)
{
Console.WriteLine();
for (int j =0; j < 10; j++)
{
if (arr[i] < arr[j])
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
Console.Write(arr[j]);
}
}
}

public void show()
{
Console.WriteLine("\nsorted");
//arr = new int[10];
for (int i = 0; i < 10; i++)
{
// Console.WriteLine(arr[i]);
}
}
}

class Program
{
static void Main(string[] args)
{
salgos a = new salgos();
a.getdata();
a.bubblesort();
Console.WriteLine("\nhttp://csharpcode13.blogspot.com/");
a.show();
}
}
}

stack code

2011-08-29T05:46:00.000-07:00

A stack is a restricted data structure, because only a small number of operations are performed on it. The nature of the pop and push operations also means that stack elements have a natural order. Elements are removed from the stack in the reverse order to the order of their addition: therefore, the lower elements are those that have been on the stack the longest

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace stack

{

class stack

{

int k;

int[] stack1;

public stack(int n)

{

k = 0;

stack1 = new int[n];

}

public void push(int ak)

{

stack1[k] = ak;

k++;

}

public int pop()

{

return stack1[k--];

}

public void show()

{

for (int i = 0; i < k; i++)

{

Console.WriteLine("value pushed at stack ={0}", stack1[i]);

}

class Program

{

static void Main(string[] args)

{

stack a = new stack(10);

a.push(4);

a.push(3);

a.push(7);

a.push(145);

a.push(105);

a.push(104);

a.pop();

a.show();

}

Linked list modified code: C#

2011-08-27T08:31:00.000-07:00

A linked list is a chain of structure or records called nodes. Each node has at least two members, one ofwhich points to the next item or node in the list! These are defined as Single Linked Lists because they only point to the next item, and not the previous. Those that do point to both are called Doubly Linked Lists.

using System;

using System.Collections.Generic;

using System.Text;

namespace linked_list

{

class node

{

public string name;

public int id;

public int ennr;

public node next;

public node()

{

id = 0;

ennr = 0;

name = "";

next = null;

}

public node(node n)

{

this.id = n.id;

this.name = n.name;

this.ennr = n.ennr;

this.next = null;

}

public node(string name1, int id1, int ennr1)

{

name = name1;

id = id1;

ennr = ennr1;

next = null;

}

class linked_list

{

node head, curr, temp;

public linked_list()

{

head = curr = temp = null;

}

public void insertnode(node n)

{

if (head == null)

{

head = curr = temp = new node(n);

}

else

{

temp = curr;

curr = new node(n);

temp.next = curr;

}

public void showdata()

{

node a = head;

while (a != null)

{

Console.WriteLine("studnet name:{0}\tid:{1}\t\tEN:{2}", a.name, a.id, a.ennr);

a = a.next;

}

public void deletefirt()

{

head = head.next;

}

public void deleteall()

{

head = null;

}

public void insertbefore(int key,node n)

{

node run = head;

node back = head;

while (run != null)

{

if (run.id == key)

{

back.next = new node(n);

back.next.next = run;

}

back = run;

run = run.next;

}

public void inserthead(node n)

{

node a = new node(n);

a.next = head;

head = a;

}

public void insertlast(node n)

{

curr.next = new node(n);

}

public void deletemid(int key)

{

node temp1 = head;

node temp2 = head;

node a = head;

while (a != null)

{

if (a.id == key)

{

temp1.next = temp2;

// temp2 = a;

break;

}

temp1 = a;

a = a.next;

temp2 = a.next;

if (head.id == key)

{

head = head.next;

}

else if (head == null)

{

Console.WriteLine("the list is null");

}

// else if(a.){ Console.WriteLine("There is no such value"); }

}

public void search(int id1)

{

bool found = false;

node a = head;

while (a != null)

{

if (a.id == id1)

{

Console.WriteLine("studnet name:{0}\tid:{1}\t\tEN:{2}", a.name, a.id, a.ennr);

found = true;

break;

}

a = a.next;

}

if(found == false)

{

Console.WriteLine("Id was not found");

}

class Program

{

static void Main(string[] args)

{

linked_list a = new linked_list();

string End;

Console.WriteLine("THE LINKED LIST WORK");

Console.WriteLine("----------------------------------------");

string z, h;

int x, y;

a.insertnode(new node("human", 120, 020321));

a.insertnode(new node("person", 43, 4321));

a.insertnode(new node("test", 83, 66321));

a.insertnode(new node("click", 1423, 02321));

a.insertnode(new node("book", 16, 5461));

a.insertnode(new node("even", 23, 4));

a.showdata();

{

try

{

Console.WriteLine("DO YOU WANT ADD NODE");

Console.WriteLine("----------------------------------------");

//Console.WriteLine("Do you want add node press y to add");

Console.WriteLine("\nto add at first press 1\nto add at last press 2\nto add at mid press 3");

string ss = Console.ReadLine();

if (ss == "3")

{

Console.WriteLine("ADD NODE AT BEFORE");

Console.WriteLine("----------------------------------------");

Console.WriteLine("Enter the name of student");

z = Console.ReadLine();

Console.WriteLine("Enter the Enrollment no of student");

y = Convert.ToInt32(Console.ReadLine());

Console.WriteLine("int the id of student should put at");

x = Convert.ToInt32(Console.ReadLine());

int key;

Console.WriteLine("node should be placed before");

key = Convert.ToInt32(Console.ReadLine());

a.insertbefore(key, new node(z, x, y));

a.showdata();

}

else if (ss == "1")

{

Console.WriteLine("ADD NODE AT HEAD");

Console.WriteLine("----------------------------------------");

Console.WriteLine("Enter the name of student");

z = Console.ReadLine();

Console.WriteLine("Enter the Enrollment no of student");

y = Convert.ToInt32(Console.ReadLine());

Console.WriteLine("Enter the id of student");

x = Convert.ToInt32(Console.ReadLine());

a.inserthead(new node(z, x, y));

a.showdata();

}

else if(ss == "2")

{

Console.WriteLine("ADD NODE AT LAST");

Console.WriteLine("----------------------------------------");

Console.WriteLine("Enter the name of student");

z = Console.ReadLine();

Console.WriteLine("Enter the Enrollment no of student");

y = Convert.ToInt32(Console.ReadLine());

Console.WriteLine("Enter the id of student");

x = Convert.ToInt32(Console.ReadLine());

a.insertlast(new node(z, x, y));

a.showdata();

}

Console.WriteLine("----------------------------------------");

Console.WriteLine("Enter 0 to end");

h = Console.ReadLine();

Console.WriteLine("----------------------------------------");

}

while (h != "0");

int ff;

{

Console.WriteLine("DO YOU WANT DELTE NODE");

Console.WriteLine("----------------------------------------");

Console.WriteLine("press 1 delete first node\npress 2 to delete all nodes\npress 3 to delte mid node");

ff = Convert.ToInt32(Console.ReadLine());

switch (ff)

{

case 1:

Console.WriteLine("DELETE FIRST NODE");

Console.WriteLine("----------------------------------------");

a.deletefirt();

a.showdata();

break;

case 2:

Console.WriteLine("DELETE ALL NODE");

Console.WriteLine("----------------------------------------");

a.deleteall();

a.showdata();

break;

case 3:

Console.WriteLine("DELETE MID NODE");

Console.WriteLine("----------------------------------------");

Console.WriteLine("Enter the id of student to delete record");

int hh = Convert.ToInt32(Console.ReadLine());

a.deletemid(hh);

a.showdata();

break;

default: Console.WriteLine("wrong input"); break;

}

// a.showdata();

Console.WriteLine("----------------------------------------");

Console.Write("TO END PRESS 0:");

ff =Convert.ToInt32( Console.ReadLine());

Console.WriteLine("----------------------------------------");

} while (ff != 0);

}

catch (Exception HH)

{

Console.WriteLine(HH.Message);

}

Console.WriteLine("DO YOU WANT SEARCH STUDENT");

Console.WriteLine("----------------------------------------");

Console.WriteLine("Enter the id of student to serch record");

int id = Convert.ToInt32(Console.ReadLine());

a.search(id);

Console.Write("TO END PRESS 0:");

End = Console.ReadLine(); Console.Clear();

} while (End != "0");

}

Code equation solver in c#

2011-08-27T08:23:00.000-07:00

put any kind off equation in this:
Example:
x^2-2sinx^3
x^5 +x^4-4x^3

it also take trigonometry functions.
and exponential functions.

public class Evalute
{

public string getpower(string expression, string type)
{
if (!expression.Contains('x'))
{
return "0";
}

int length = expression.Length - 1;
string power = "";
if (type == "Sin" || type == "Cos" || type == "e")
{
length = (expression.IndexOf(type) - 1);
if (!expression.Substring(0, length).Contains('x'))
{ return "0"; }
}

for (int a = length; a > 0; a--)
{
char chr = expression[a];
if ((chr >= '0' && chr <= '9') || chr == '.')
{ power = chr + power; }
else if ((chr == 'x' || chr == '^') && power == "")
{
power = "1";
break;
}
else break;
}
return power;
}
}

public class Expression
{
Evalute evalute;
string[] operation; string[] trignometric;
string[] trigpower; string[] constants;
string[] conspower; string expression;
int parts, size; double total;
double output;
public Expression(int s, string i)
{
size = s;
expression = i;
operation = new string[size];

for (int a = 0; a < size; a++)
{
if (expression[a] == '+' || expression[a] == '-')
{
parts++;
operation[parts] += expression[a];
}
else
operation[parts] += expression[a];
}

trignometric = new string[parts + 1];
trigpower = new string[parts + 1];
conspower = new string[parts + 1];
constants = new string[parts + 1];
output = 1;
total = 0;
evalute = new Evalute();
}

public void evaluteexpression()
{
for (int i = 0; i <= parts; i++)
{
string input = operation[i];
bool trigno = false;

if (input.Contains("Sin")) { trignometric[i] = "Sin"; trigno = true; }
if (input.Contains("Cos")) { trignometric[i] = "Cos"; trigno = true; }
if (input.Contains("e")) { trignometric[i] = "e"; trigno = true; }

if (trigno == true)
{
trigpower[i] = evalute.getpower(input, "None");
}
conspower[i] = evalute.getpower(input, trignometric[i]);

for (int j = 0; j < input.Length; j++)
{
char chr = input[j];
if ((chr >= '0' && chr <= '9') || chr == '+' || chr == '-' || chr == '.')
{
constants[i] += chr;
}
else break;
}
if (constants[i] == null || constants[i] == "-" || constants[i] == "+")
{
constants[i] += "1";
}

}
}

public double funcx(double x)
{
total = 0;
for (int i = 0; i <= parts; i++)
{
double tpower = 1;
output *= Convert.ToDouble(constants[i]);
double temp = Convert.ToDouble(conspower[i]);
output *= Math.Pow(x, temp);
if (trigpower[i] != "0")
{
tpower = Convert.ToDouble(trigpower[i]);
if (trignometric[i] == "Sin")
{
output *= Math.Sin(Math.Pow(x, tpower));
}
if (trignometric[i] == "Cos")
{
output *= Math.Cos(Math.Pow(x, tpower));
}
if (trignometric[i] == "e")
{
output *= Math.Exp(Math.Pow(x, tpower));
}
}
total += output;
output = 1;
}
return total;
}
}

static void Main(string[] args)
{
string equation = "3x^2Sinx^3+4x^3Cosx^2-3x^6+400x^4";
int s = equation.Length;
Expression eq = new Expression(s, equation);
eq.evaluteexpression();
Console.WriteLine("the ans is {0} ", eq.funcx(1.5));
}

Tips on creating your on Web

2011-08-26T13:19:00.000-07:00

How to create a web

Great Tips

on site devoloping

easy ways to create your own web.
You can create a website by using any software like

Adobe Dreamweaver.

this book contain all the information of what is html basic concept.

c sharp binary tree program.

2011-08-26T12:59:00.000-07:00

In computer science, a binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents.

SIMPLE C# BINARY TREE CODE

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

namespace Binary_Tree
{
class BinaryTreeNode
{
private char id;
public void setID(char _id){id=_id;}
public char getID(){return id;}
public BinaryTreeNode left; public BinaryTreeNode right;
public BinaryTreeNode(){left=right=null;}
public BinaryTreeNode(char _id){id=_id;left=right=null;}
}
class BinaryTree
{
private BinaryTreeNode root;
public BinaryTree(){root = null; }
public void insert(char c)
{
addNode(c, ref root);
}
private void addNode(char c, ref BinaryTreeNode rptr)
{
if (rptr == null)
rptr = new BinaryTreeNode(c);
else if (rptr.left == null)
addNode(c, ref rptr.left);
else if (rptr.right == null)
addNode(c, ref rptr.right);
else
addNode(c, ref rptr.left);
}

public void inOrderTraversal()
{
inOrderTraversalHelper(root);
}
private void inOrderTraversalHelper(BinaryTreeNode r)
{
if (r != null)
{
inOrderTraversalHelper(r.left);
Console.Write("{0} ", r.getID());
inOrderTraversalHelper(r.right);
}
}
public void preOrderTraversal()
{
preOrderTraversalHelper(root);
}
private void preOrderTraversalHelper(BinaryTreeNode r)
{
if (r != null)
{
Console.Write("{0} ", r.getID());
preOrderTraversalHelper(r.left);
preOrderTraversalHelper(r.right);
}
}
public void postOrderTraversal()
{
postOrderTraversalHelper(root);
}
private void postOrderTraversalHelper(BinaryTreeNode r)
{
if (r != null)
{
postOrderTraversalHelper(r.left);
postOrderTraversalHelper(r.right);
Console.Write("{0} ", r.getID());
}
}
}
class Program
{
static void Main(string[] args)
{
BinaryTree b = new BinaryTree();
b.insert('A');
b.insert('B');
b.insert('C');
b.insert('D');
b.insert('E');
b.insert('G');
b.insert('H');
b.insert('F');
b.insert('J');
b.insert('K');
b.insert('L');
Console.WriteLine("The Inorder Traversal:\n");
b.inOrderTraversal();
Console.WriteLine("\n\nThe Preorder Traversal:\n");
b.preOrderTraversal();
Console.WriteLine("\n\nThe Postorder Traversal:\n");
b.postOrderTraversal();
Console.WriteLine();

}

}
}

a simple program for binary tree in c# for any help you can leave a comment

Linked list Easy way to creat on c #

2011-04-29T21:26:00.000-07:00

LINKED LIST EASY C SHARP CODE.

The program blow has some function's incomplete complete it by your self and do let me know how is it.

thanks. and don't forget to visit link given blow.

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

namespace node_name
{
   class node
   {

   public string name;
   public int id;
   public node next;

   public node()
   {
   name = "";
   id = -1;
   next = null;
   }
   public node(node n)
   {
   this.id = n.id;
   this.name = n.name;
   this.next = null;
   }
   public node(string na, int i)
   {
   name = na;
   id = i;
   next = null;
   }

   //internal node next()
   //{
   // throw new NotImplementedException();
   //}
   }
   class link_list
   {
   node curr;
   node head;
   node temp;


   public link_list()
   {
   curr = head = temp = null;
   }
   public void insert(node n)
   {
   try
   {
   if (head == null)
   {
   curr = temp = head = new node(n);
   }
   else
   {
   temp = curr;
   curr = new node(n);
   temp.next = curr;

   // else { Console.WriteLine("kush garbar ha"); }
   }

   }
   catch (Exception ex)
   { Console.WriteLine("{0}", ex.Message); }
   }
   public void deletefirst()
   {
   Console.WriteLine("\nDelete value id {0} name {1}", head.id, head.name);
   head = head.next;

   }
   public void shownode()
   {
   try
   {
   node a = head;
   while (a != null)
   {
   Console.WriteLine("id = {0} name = {1}", a.id, a.name);
   a = a.next;
   }
   }
   catch (Exception ex)
   { Console.WriteLine(ex.Message); }
   }
   public void deletall()
   {
   head = null;

   }

   public void check1( )
   {
   node n=head;

   node check = head;
   Console.WriteLine("\n\nhead {0} :head {1} : check.n {2} : cechk.n {3}", head.id, head.name, check.next.id, check.next.name);
   }
   public void check2(node n)
   {
   try
   {
   node t;
   if (head == null)
   {
   temp = head = curr = new node(n);
   }
   else
   {
   t = new node(n);
   if (t.id < head.id)
   {
   t.next = head;
   head = t;
   // t.next = null;
   }
   else
   {
   node test = head;

   while (test.next != null)
   {
   test = test.next;
   if (t.id < test.id)
   {
   t.next = test;
   test = t;
   }
   }
   temp = curr;
   temp.next = curr;
   }
   }

   }
   catch (Exception ex)
   {
   Console.WriteLine(ex.Message);
   }
   }

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

   link_list list = new link_list();
   //list.insert(new node("head", 500));
   //list.insert(new node("head.next#", 2));
   //list.insert(new node("head.next.next #", 32));
   //list.insert(new node("gudu #", 113));
   //list.insert(new node("temp #", 12));
   //list.insert(new node("curr #", 4));
   //list.shownode();

   Console.WriteLine("\nwhat happend actually\n");

   //list.refrencechange();
   list.check2(new node ("toufique" ,2));
   list.check2(new node("ahmed ", 1));
   list.check2(new node("ahmed ", 5));

   list.shownode();

   list.check1();
   //list.shownode();
   //list.deletefirst();
   //list.deletefirst();
   //list.deletefirst();
   //list.deletall();
   //list.shownode();

   }
   }
}

YOU CAN ALSO USE GENERICS INSTEAD OF WRITE WHOLE LINKED LIST CODE. BUILT IN C#

do comment to let me know.

2010-10-11T08:43:00.001-07:00