原创 The Merge Sort
Merge sort is a recursive algorithm that continually splits a list in half. If the list is empty or has one item, i
原创 The Selection Sort
A selection sort looks for the largest value as it makes a pass and, after completing the pass, places it in the pr
原创 Linked Data structure
To understand the abstract data types stack, queue, deque, and list. To be able to implement the ADTs stack, queue,
原创 初步學習JAVA網絡編程
初步學習JAVA網絡編程 今天我開始學習JAVA NETWORKING 一下內容爲摘抄教程網站。 http://www.javatpoint.com/java-networking Java Networking Java Ne
原创 Sorting methods Summary
A sequential search is O(n) for ordered and unordered lists. A binary search of an ordered list is O(logn) in the
原创 Sorting
The Bubble Sort The bubble sort makes multiple passes through a list. It compares adjacent items and exchanges thos
原创 The Quick Sort
A quick sort first selects a value, which is called the pivot value. Although there are many different ways to choo
原创 Search
The Sequential Search To be able to explain and implement sequential search and binary search. To be able to expla
原创 The Insertion Sort
插入排序法 默認第一個元素爲最小,默認他是排序的 從第二個元素查找, 如果,第二個元素比第一個小,那麼對調位置。 以此類推 mark first element as sorted for each unsorted ele
原创 Stack
This ordering principle is sometimes called LIFO, last-in first-out. It provides an ordering based on length of tim
原创 Java I/O
Java uses the concept of stream to make I/O operation fast. Stream A stream is a sequence of data.In Java a stream is c
原创 學習方法
數據結構 是如何構成的 各個數據結構是如何使用的 題型
原创 Python 學習LINK
http://python.xiaoleilu.com/001.html http://www.cnblogs.com/dolphin0520/category/400707.html
原创 Heap應用
Data compression: Huffman Coding algorithm Shortest path algorithms: Dijkstra’s algorithm Min spanning tree:prim’s al
原创 The Unordered List Abstract Data Type
The structure of an unordered list, as described above, is a collection of items where each item holds a relative posit