Python
丸子学步园
这个作者很懒,什么都没留下…
展开
-
The Insertion Sort
插入排序法转载 2015-11-08 06:38:14 · 726 阅读 · 0 评论 -
Heap 练习题
Basic find-max or find-min: find the maximum item of a max-heap or a minimum item of a min-heap (a.k.a. peek)insert: adding a new key to the heap (a.k.a., push[1])extract-min [or extract-max]: returns原创 2015-11-17 09:53:05 · 616 阅读 · 0 评论 -
linkedlist
链表问题包含: 删除节点,插入排序,旋转Remove Linked List Elements# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = Noneclass Solution:原创 2015-11-17 01:06:06 · 333 阅读 · 0 评论 -
Heap应用
Data compression: Huffman Coding algorithm Shortest path algorithms: Dijkstra’s algorithm Min spanning tree:prim’s algorithm Even-driven simulation:customer in a line Selection problem: Finding kth转载 2015-11-16 14:53:16 · 436 阅读 · 0 评论 -
Heap
https://www.youtube.com/watch?v=fJORlbOGm9Yhttps://www.youtube.com/watch?v=LhhRbRXhB40转载 2015-11-10 20:00:14 · 330 阅读 · 0 评论 -
节点操作总结
Stack 添加元素 def push( self, newValue ): self.top = LinkedNode( newValue, self.top )队列添加元素def enqueue( self, newValue ): newNode = LinkedNode( newValue ) if self.front == None:转载 2015-11-11 11:38:22 · 420 阅读 · 0 评论 -
Tree
树节点Inserting an element into a tree Deleting an element from a tree searching for an element Traversing the treefinding the size of the tree finding the height of the tree find level class BTNode转载 2015-11-09 03:54:31 · 369 阅读 · 0 评论 -
The Ordered List Abstract Data Type
The structure of an ordered list is a collection of items where each item holds a relative position that is based upon some underlying characteristic of the item. The ordering is typically either ascen转载 2015-11-09 01:05:00 · 500 阅读 · 0 评论 -
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 position with respect to the others. Some possible unordered list operations are given转载 2015-11-09 00:14:22 · 669 阅读 · 0 评论 -
Linked Data structure
To understand the abstract data types stack, queue, deque, and list.To be able to implement the ADTs stack, queue, and deque using Python lists.To understand the performance of the implementations of b转载 2015-11-08 09:15:29 · 430 阅读 · 0 评论 -
Queue
The most recently added item in the queue must wait at the end of the collection. The item that has been in the collection the longest is at the front. This ordering principle is sometimes called FIFO,转载 2015-11-08 09:48:59 · 373 阅读 · 0 评论 -
Stack
This ordering principle is sometimes called LIFO, last-in first-out. It provides an ordering based on length of time in the collection. Newer items are near the top, while older items are near the base转载 2015-11-08 09:38:25 · 339 阅读 · 0 评论 -
The Quick Sort
A quick sort first selects a value, which is called the pivot value. Although there are many different ways to choose the pivot value, we will simply use the first item in the list. The role of the piv转载 2015-11-08 09:00:35 · 706 阅读 · 1 评论 -
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, it is sorted by definition (the base case). If the list has more than one item, we spli转载 2015-11-08 06:43:37 · 851 阅读 · 0 评论 -
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 proper location. As with a bubble sort, after the first pass, the largest item is in t转载 2015-11-08 05:59:55 · 772 阅读 · 0 评论 -
Search
The Sequential SearchTo be able to explain and implement sequential search and binary search. To be able to explain and implement selection sort, bubble sort, merge sort, quick sort, insertion sort, a转载 2015-11-08 00:30:00 · 656 阅读 · 0 评论 -
Sorting
The Bubble SortThe bubble sort makes multiple passes through a list. It compares adjacent items and exchanges those that are out of order. Each pass through the list places the next largest value in it转载 2015-11-08 04:42:21 · 523 阅读 · 0 评论 -
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 worst case. Hash tables can provide constant time searching. A bubble sort, a select转载 2015-11-08 09:09:03 · 383 阅读 · 0 评论 -
Python 学习LINK
http://python.xiaoleilu.com/001.html http://www.cnblogs.com/dolphin0520/category/400707.html原创 2015-11-18 22:59:07 · 533 阅读 · 0 评论