2015年10月_gaoxiangnumber1

12月 11月 10月 09月 08月 04月 03月 02月 01月

原创 Chapter 4-02

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 4.1.4 Y86 Exceptions The possible values for status code Stat (describing the overall state of the executing

2015-10-26 00:28:53 300

原创 Chapter 4-01

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 4.1 The Y86 Instruction Set Architecture 4.1.1 Programmer-Visible State There are eight program registers:

2015-10-26 00:28:22 380

原创 Ch4-MaxSubArray

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. Review: MaxSubArray.cc Description: 给出一个长度为N的序列：a1,a2,……，an,求最大连续和。 Algorithm1: divide and conquer 思路解析：

2015-10-24 00:47:04 348

原创 N-Queen Problem

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 使用回溯算法解决N皇后问题. 问题描述：棋盘为N*N的，在该棋盘上放置N个皇后，使得任意两个皇后不在同一行或者同一列或者同一对角线（主对角线和副对角线）。 解题思路：必定使得棋盘的每一行每一列均存在且只存在

2015-10-23 00:34:54 579

原创 Chapter 3-08

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 3.13 x86-64: Extending IA32 to 64 Bits 3.13.1 History and Motivation for x86-64 The word size of a machine d

2015-10-23 00:33:39 398

原创 Chapter 3-07

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 3.10 Putting It Together: Understanding Pointers Every pointer has an associated type. This type indicates wh

2015-10-23 00:33:07 382

原创 Chapter 2-InsertionSort

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 插入排序(Insertion Sort)的基本思想是：每次将一个待排序的元素，按其大小插入到前面已经排好序的子序列中的适当位置，直到全部元素插入完成为止。 设数组为a[0…n-1]。 1.初始时，a[0]自成1个有

2015-10-23 00:31:01 356

原创 Chapter 3-06

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 3.8 Array Allocation and Access 3.8.1 Basic Principles Suppose E is an array of ints, and we wish to evaluat

2015-10-19 00:29:21 375

原创 Chapter 3-05

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 3.7 Procedures 3.7.1 Stack Frame Structure IA32 programs make use of the program stack to support procedure

2015-10-19 00:28:51 488

原创 Chapter 3-04

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 3.6.4 Translating Conditional Branches The assembly-code first compares the two operands (line 3), setting

2015-10-19 00:28:16 336

原创 Chapter 11BinarySearchTree

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 二叉搜索树(binary search tree)是一棵可能为空的二叉树,一棵非空的二叉搜索树满足以下特征: 1) 每个元素有一个唯一的关键值。 2) 根节点左子树的关键值(如果存在)小于根节点的关键值。 3) 根

2015-10-15 00:33:11 335

原创 Chapter 3-03

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 3.6 Control Machine code provides two basic low-level mechanisms for implementing conditional behavior: it te

2015-10-12 00:22:15 328

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 优先队列(priority queue) 是0个或多个元素的集合,每个元素都有一个优先权或值,对优先队列执行的操作有 1) 查找;2) 插入一个新元素; 3) 删除。在最小优先队列( min priority queue

2015-10-12 00:21:25 320

原创 Chapter 8-BinaryTree

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. Review: BinaryTree.h Queue.h Test.cc 先序遍历：根结点→左结点→右结点；中序遍历：左结点→根结点→右结点；后序遍历：左结点→右结点→根结点。 1.给定先序和中序建立二叉

2015-10-12 00:19:58 395

原创 Chapter 3-02

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 3.5 Arithmetic and Logical Operations Each of the instruction classes shown has instructions for operating on

2015-10-10 00:32:20 280

原创 Chapter 3-01

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 3.1 A Historical Perspective 3.2 Program Encodings unix> gcc -O1 -o p p1.c p2.c -O1 instructs the compiler

2015-10-08 23:56:19 376

原创 Ch7-HashTable

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. 散列是用一个散列函数( hash function)把关键字映射到散列表( hash table)中的特定位置。在理想情况下，如果元素 e 的关键字为k，散列函数为f，那么e在散列表中的位置为 f (k)。要搜索关键字为

2015-10-02 00:22:38 412

原创 Ch6-Queue_Linked

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. Review: Queue_Linked.h Queue_linked_Test.cc Queue_Linked.h/*Review:class Node;class LinkedQueue;~Linked

2015-10-02 00:21:21 323

原创 Ch6-Queue_Array

Please indicate the source if you want to reprint: http://blog.csdn.net/gaoxiangnumber1. Review: Queue_Array.h Queue_Array_Test.ccQueue_Array.h#ifndef QUEUE_H_INCLUDED#define QUEUE_H_INCLUDEDusin

2015-10-02 00:19:58 320

iwlwifi.ko

ubuntu 16.04中的/lib/modules/4.10.0-27-generic/kernel/drivers/net/wireless/intel/iwlwifi/iwlwifi.ko

2017-10-03

4.8.0-53-generic-iwlwifi.ko

2017-06-07

不会的题目不能看懂后独立写出代码

2014-10-02

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

gaoxiangnumber1——Gao Xiang's Blog