ASP.NET常用代码题库功能实现

1、汉诺塔:namespace 汉诺塔class HanoiBuildervoid hanoi(int n,string A,string B,string C)if(n=1)Console.WriteLine(A+-+C);elsehanoi(n-1,A,C,B);/借助C把A上的盘子移到BConsole.WriteLine(A+-+C);hanoi(n-1,B,A,C);/借助A把B上的盘子移到Cpublic void Hanoi(int n)hanoi(n,A,B,C);class Teststatic void Main()HanoiBuilder hb=new HanoiBuilder();hb.Hanoi(2);Console.ReadLine();二叉树遍历:namespace BinaryTree public class Node/节点类 private object _nodeValue; private Node _leftNode; private Node _rightNode; public object NodeValue get return this._n

2、odeValue; public Node LeftNode get return this._leftNode; set this._leftNode = value; public Node RightNode getreturn this._rightNode; setthis._rightNode = value; public Node() public Node(object nodeValue, Node leftNode, Node rightNode) this._nodeValue = nodeValue; this._leftNode = leftNode; this._rightNode = rightNode; public Node(object nodevalue) this._nodeValue = nodevalue; this._leftNode = null; this._rightNode = null; public class BTree private static Node root = null; public static void

3、CreateTree() Node node1 = new Node(1, null, null); Node node2 = new Node(2, null, null); Node node3 = new Node(3, null, null); Node node4 = new Node(4, null, null); Node node5 = new Node(5, null, null); Node node6 = new Node(6, null, null); Node node7 = new Node(7, null, null); node1.LeftNode = node2; node1.RightNode = node3; node2.LeftNode = node4; node2.RightNode = node5; node3.LeftNode = node6; node3.RightNode = node7; root = node1; private static void frontList(Node node) if (node = null) re

4、turn; else Console.WriteLine(node.NodeValue+t); frontList(node.LeftNode); frontList(node.RightNode); private static void middleList(Node node) if (node = null) return; else middleList(node.LeftNode); Console.WriteLine(node.NodeValue+t); middleList(node.RightNode); private static void backList(Node node) if (node = null) return; else backList(node.LeftNode); backList(node.RightNode); Console.WriteLine(node.NodeValue+t); public static void ShowList() CreateTree(); Console.WriteLine(前序遍历如下：); front

5、List(root); Console.WriteLine(中序遍历如下：); middleList(root); Console.WriteLine(后序遍历如下：); backList(root); public class Demo public static void Main(string args) BTree.ShowList(); 快速排序:namespace QuickSortpublic static class Sortpublic static void Main()Console.WriteLine(排序前:);ShowAry();Console.WriteLine(排序后:);quickSortAry(al, 0, al.Count-1);ShowAry();Console.ReadLine();private static ArrayList al;private static Random random;static Sort()random = new Random(System.DateTime.Now.Millisecond);al = new A

6、rrayList();for (int i = 0; i 500; i+)al.Add(random.Next(1, 100001);public static void ShowAry()foreach (int i in al)Console.Write(i+t);private static void quickSortAry(ArrayList al, int start, int end)int i = start;int j = end;int pivot = (int)ali;while (i j)while (i j & pivot = (int)alj)j-;ali = alj;while (i = (int)ali)i+;alj = ali;ali = pivot;if (i start)quickSortAry(al, start, i - 1); if (i end)quickSortAry(al, i + 1, end); 冒泡排序算法:public class BubbleSortpublic static void Main()int intary=45,67,34,23,12,89;Console.WriteLine(排序前，输出数组如下：);PrintArray(intary);Sort(intary);Console.WriteLine(冒泡排序之后，输出数组如下：);PrintArray(intary); public static void PrintArray(int tmpary)for(int i=0;itmpary.Length;i+)Console.Write(tmparyi+t);Console.WriteLine();public static void Sort(int ary)i

《ASP.NET常用代码题库功能实现》由会员晓***分享，可在线阅读，更多相关《ASP.NET常用代码题库功能实现》请在金锄头文库上搜索。