- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Selection sort
<br /><br />Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A[1]. Then find the second smallest element of A, and exchange it with A[2]. Continue in this manner for the first n
2011-04-25 22:53:00
483
转载 William Deresiewicz 斯坦福大学演讲：不要在不断的优秀里走向平庸(zz)
<br />William Deresiewicz 2010年在斯坦福大学的演讲：<br /><br /><br /><br />我的题目提出的问题，当然，是一个传统地面向人文科学的专业所提出的问题：学习文学、艺术或哲学能有什么实效价值（practical value）？你肯定纳闷，我为什么在以科技堡垒而闻名的斯坦福提出这个问题呢？大学学位给人带来众多机会，这还有什么需要质疑的吗？<br /><br />但那不是我提出的问题。这里的“做（do）”并不是指工作（job），“那(that)”并不是指你的专业（m
2011-04-25 22:43:00
910
原创 Insertion sort algorithm
Insertion sort is an efficient algorithm for sorting a small number of elements, which costs O(n2).The operation of INSERTION-SORT on the array A = 〈5, 2, 4, 6, 1, 3〉. Array indices appear above the rectangles, and values stored in the array positions
2011-04-25 22:36:00
808
翻译 translation:Achieving of Chinese Display in the embedded graphical user interface of uC/GUI in Two
Translation:http://www.docin.com/p-43459745.html#I only translate essential parts of this essay and omit trivial parts. Achieving of Chinese Display in the embedded graphical user interface of uC/GUI in Two MethodsAbstract: This article p
2011-04-25 21:36:00
893
原创 Heapsort algorithm
/*the purpose of this program is to sort the array by using heap. The subroutine INPUT_ARRAY isto input the numbers of the array. the subroutine MAX_HEAPIFY is to maintain the property ofMAX-HEAP by permutating the i node and its children node which
2011-04-25 21:28:00
509
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人