摘要:with a poisoned dagger, chump! 让毒匕首跟你说, 笨蛋。Yeah, I got it, but I gotta get it gone! 我是有,但我现在不要了。Relax, I'm making some modifications to my helmet. 放松,...
阅读全文
摘要:Agraphis a set ofverticesand a collection ofedgesthat each connect a pair of vertices. We use the names 0 through V-1 for the vertices in a V-vertex g...
阅读全文
摘要:Raised in a noodle shop, 在面馆长大Never seeking glory of fame, 从未相当大侠He climbed a mountaintop, 一朝登的凌绝顶And earned the Dragon Warrior name 神龙之名冠天下Master Shi...
阅读全文
摘要:.NEThttp://csharp.2000things.com/index/http://wpf.2000things.com/http://www.dotnetrocks.com/http://wpftutorial.net/HowToCreateACustomControl.htmlLearn...
阅读全文
摘要:Overview:Layout is the critcal component of an application's usability on a wide range of devices.Layout process:WPF layout takes place in two stages:...
阅读全文
摘要:booch's object model: The C++& Java perspective:http://www.enel.ucalgary.ca/People/Smith/619.94/prev689/61994.96/1996/talks/tbooch.htm
阅读全文
摘要:快速排序是一种分治的排序。快速排序与归并排序是互补的: 归并排序将数组分成两个子数组分别排序,并将有序的子数组归并以将整个数组排序;而快速排序将数组首先切分成两个子串,然后分别排序。相关的代码:public static void QuickSort(char[] a, int lo, int hi...
阅读全文
摘要:该算法基于一个简单的操作: 将两个有序的队列合成一个更大的有序队列。归并排序保证NlogN。原地归并的抽象算法(Abstract in-place merge):using System;namespace MergeSort{ class Program { static...
阅读全文
摘要:http://algs4.cs.princeton.edu/21elementary/排序算法分析:比较(Compare),交换(Exchange),如果没有使用选择排序:首先,找到最小的元素然后和第一个数做交换,然后在剩下的元素里找最小的,和第二个数做交换,一直下去。选择排序用了: ~N2/2 次...
阅读全文