2013年08月__iorilan

12月 11月 10月 09月 08月 07月 06月 05月 03月 02月 01月

原创 Asp.net Design Pattern study notes -- PART 2

Smart UI ArchitectureExample:What’s problem ? 1. store procedure is too heavy2. Data access ,Business layer , service seems didnothing3. UI is too heavy !4. Hard to

2013-08-26 16:55:59 1216

原创 Pass value between Parent page and dialog page

pass value between parent page and dialog page 1.open new window, pass value base page : $("#btnOpenNewPage").click(function () { window.open("DialogPage.aspx");//must open

2013-08-24 22:07:48 1613

原创 Javascript do Postback

whenever you want to do a postback from javascript side : 1.Add a server side button and set its visible = false: 2.add javascript code : __doPostBack("", '');

2013-08-24 22:02:20 2069

原创 Asp.Net Design Pattern Studynotes -- Part1

Asp.Net Design Pattern Studynotes -- Part1 let's start with an exampleto entry amazing OO world ! let's saynow we need to implement a small feature which need :an entityclass: Product

2013-08-20 15:30:42 1283

原创 how to use MEF do DI(DEPENDENCY INJECTION )

MEF Demo 1. Create one interface project ,named IMEFTestCommon Add interface codepublic interface IPrintf { void Print(); } 2. Create one implement project

2013-08-17 22:19:59 1202

原创排序详解之快速排序

快速排序快速排序使用分治的思想，以某个数为分割点，每一趟排序下来，左边数都比它小，右边数都比它大，然后再对左右两边数组做递归操作。时间复杂度(平均情况)：n*lg(n) 排序步骤：1. 以左边首元素为分割点，拿出来存在midElement里（这时候左边首位置空了）2. 从右边找比midElement小的数，放在刚才左边空的位置，就是首位（这时，

2013-08-17 11:42:29 1362

原创排序详解之归并排序

归并排序本文章将介绍归并排序，时间复杂度为n*lg(n)的归并排序，不仅效率高，而且是稳定的（而堆排序，快排是不稳定的）。要排序的数组：5 , 1, 9 ,3, 7 , 4 , 8 ,6 , 2 归并排序过程：1. 计算组元素个数,count ,以count=2为起始个数，每次count*=2,count∈[2,arr.Count]2. 每次把数

2013-08-17 10:43:25 1127

原创（排序详解之堆排序）

堆排序本文将介绍一下堆排序的过程。要点：（最小堆为例）1. 调整堆函数：传入节点索引，对比当前节点与父节点大小，如果小于则交换位置，以父节点位置递归执行。2. 设index=Arr.Count/ 2 -1 ,取到index位置的子节点，将子节点和当前节点依次传入递归函数执行，i∈[0,index],i--循环执行3. 每次移除根节点，

2013-08-15 23:44:38 1205

原创 Shell Sort (排序详解之希尔排序)

排序详解之希尔排序

2013-08-15 17:29:43 1810 3

原创 Selection Sort(排序详解之选择排序)

排序详解之选择排序

2013-08-14 11:39:44 1506

原创 Javascript 文本框只能输入1-4

step1 :清空当前值step 2:限制输入，只接受1-4document.getElementById("txtTest").onkeypress = function(evt){this.value = '';//clean value evt = (evt) ? evt : window.event; var charCode = (evt.which

2013-08-14 10:48:50 1143

原创 2-3 Tree (Multiple Searching Tree )

2-3Tree Defination :1. A tree can have more than one values2. If node have 1 value ,then only 2 children3. If node have 2 value ,then have 3 children During Insertion ,

2013-08-09 17:34:18 1196

原创二分查找，插值查找，斐波那契查找

二分查找，插值查找，斐波那契查找：1.二分查找：伪代码：while(leftbeginif key == arr[left] or key == arr[right] or key == arr[left+right/2]return indexelse if key< arr[(left+index)/2]then right = (left+right)/2

2013-08-09 16:12:37 1114

原创 CPM(Critical Path Method )

CPM(Critical Path Method ) is now widely used in projectmanagement to control the schedule of the project life cycle . Now I will show you how to find out the critical activities andhow to create

2013-08-02 12:09:18 2055

原创 How To Get Min-Cost Between two points in graph (Dijkstra’s algorithm)

How To Get Min-Cost Between twopoints in graph(Dijkstra’s algorithm) Now See This Graph :which is just like asubway map . Now Question is : how to calculate fromA to (B,C,D,E,F

2013-08-01 17:05:42 1373 1