新项目的第一天（Expression Web）
摘要：今天进新项目组了，是Expression大家族的web组。新的环境，毕竟有些陌生，不过感觉组内的人还不错，Microsoft Expression Web 4 将会在明年发布，这样正好可以经历一个完整的release，希望自己可以在这里较好的成长。 下面是对Expression Web的一些介绍： Expression Web 是一个专业的设计工具，可用来建立现代感十足、且以标准为基础的网站，...
阅读全文
posted @
2009-11-09 23:13
lantionzy
阅读(438)
推荐(0) 编辑
Assembly(程序集)
摘要：作为一个单元进行版本控制和部署的一个或多个文件的集合。程序集是 .NET Framework 应用程序的主要构造块。所有托管类型和资源都包含在某个程序集内，并被标记为只能在该程序集的内部访问，或者被标记为可以从其他程序集中的代码访问。程序集在安全方面也起着重要作用。代码访问安全系统使用程序集信息来确定为程序集中的代码授予的权限集。 程序集是 .NET Framework 编程的基本组成部分。程序...
阅读全文
posted @
2009-11-08 23:06
lantionzy
阅读(745)
推荐(2) 编辑
ASP.NET vs ASP
摘要：New in ASP.NET 1. Better language support 2. Programmable controls 3. Event-driven programming 4. XML-based components 5. User authentication, with accounts and roles 6. Higher scalab...
阅读全文
posted @
2009-11-05 22:19
lantionzy
阅读(417)
推荐(1) 编辑
Three Ways to Insert CSS(浅析三种插入css的方法)
摘要：When a browser reads a style sheet, it will format the document according to it. There are three ways of inserting a style sheet:External style sheet, Internal style sheet andInline style. Below are t...
阅读全文
posted @
2009-11-04 17:44
lantionzy
阅读(848)
推荐(2) 编辑
Algorithm backup ---- Merge Sort(归并排序算法)
摘要：Merge sort is an O(n log n) comparison-based sorting algorithm. In most implementations it is stable, meaning that it preserves the input order of equal elements in the sorted output. It is an example...
阅读全文
posted @
2009-11-03 17:39
lantionzy
阅读(394)
推荐(1) 编辑
Algorithm backup ---- Heap Sort(堆排序算法)
摘要：Heapsort is acomparison-based sorting algorithm, and is part of the selection sort family. Although somewhat slower in practice on most machines than a good implementation ofquicksort, it has the adva...
阅读全文
posted @
2009-11-03 17:09
lantionzy
阅读(469)
推荐(1) 编辑
Algorithm backup ---- Selection sort(选择排序算法)
摘要：Selection sort is also asorting algorithm, specifically anin-place comparisonsort. It has O(n2) complexity, making it inefficient on large lists, and generally performs worse than the similarinsertion...
阅读全文
posted @
2009-11-03 16:35
lantionzy
阅读(257)
推荐(1) 编辑
Algorithm backup ---- Insertion Sort(插入排序算法)
摘要：Insertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms...
阅读全文
posted @
2009-11-03 16:21
lantionzy
阅读(297)
推荐(1) 编辑
Algorithm backup ---- Compare occurences of each character of two strings(比较两个字符串每个字符出现频率是否一样)
摘要：Here are two strings, my task is to compare these two str1 and str2, and get if the occurences of each character of them are equal. As we know, we can get the ASCII code of a character, so I use an a...
阅读全文
posted @
2009-11-03 15:26
lantionzy
阅读(378)
推荐(1) 编辑
Algorithm backup ---- Find the kth largest number(寻找第K大数)
摘要：Here is a way to find the k-th largest number from an ayyay based on the theory of quick sort with an algorithmic complexity of O(n). First we find a base element from the array randomly, and then re...
阅读全文
posted @
2009-11-03 14:31
lantionzy
阅读(652)
推荐(1) 编辑
Algorithm backup ---- Quick Sort(快速排序算法)
摘要：The quick sort is an in-place, divide-and-conquer, massively recursive sort. Typically, quicksort is significantly faster in practice than other Θ(nlogn) algorithms, because its inner loop can be...
阅读全文
posted @
2009-11-03 13:26
lantionzy
阅读(344)
推荐(1) 编辑
Algorithm backup ---- Bubble Sort(冒泡排序算法)
摘要：The bubble sort is the oldest and simplest sort in use. Unfortunately, it's also the slowest. The bubble sort works by comparing each item in the list with the item next to it, and swapping them if ...
阅读全文
posted @
2009-11-03 10:32
lantionzy
阅读(372)
推荐(1) 编辑
That something between String and StringBuilder(String和StringBuilder之间的异同)
摘要：First, we take some time to have a look at these words: "The String object is immutable. Every time you use one of the methods in the System.String class, you create a new string object in memory, whi...
阅读全文
posted @
2009-11-01 17:16
lantionzy
阅读(258)
推荐(1) 编辑
