<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/juwong</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; juwong]]></copyright><item><title><![CDATA[《汇编语言（第3版）》王爽 实验11 编写子程序]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/75212229</link><guid>https://blog.youkuaiyun.com/juwong/article/details/75212229</guid><author>juwong</author><pubDate>Sun, 16 Jul 2017 21:24:28 +0800</pubDate><description><![CDATA[还可以把inc si调整一下位置，全用jmp系列指令实现循环，而不用loop


assume cs:code

data segment
	db "Beginner's All-purpose Symbolic Instruction Code.",0
data ends

code segment
	start:
		mov ax,data
		mov ds,ax
		mov si,0
]]></description><category></category></item><item><title><![CDATA[《汇编语言（第3版）》王爽 实验10.2 解决除法溢出的问题]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/75137028</link><guid>https://blog.youkuaiyun.com/juwong/article/details/75137028</guid><author>juwong</author><pubDate>Fri, 14 Jul 2017 21:49:28 +0800</pubDate><description><![CDATA[assume cs:code

code segment
	start:
		mov ax,0e6a8h
		mov dx,0003h
		mov cx,20h
		call divdw
										
		mov ax,4c00h
		int 21h
		
	divdw:
		push bx
		push di
		
		mov bx,ax
		
		mov ax,dx
		mov dx,]]></description><category></category></item><item><title><![CDATA[《汇编语言（第3版）》王爽 实验10.1 显示字符串]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/75092661</link><guid>https://blog.youkuaiyun.com/juwong/article/details/75092661</guid><author>juwong</author><pubDate>Thu, 13 Jul 2017 21:12:32 +0800</pubDate><description><![CDATA[assume cs:code

data segment
	db 'Welcome to masm!',0
data ends

code segment
	start:
		mov dh,20
		mov dl,20
		mov cl,11111111b
		mov ax,data
		mov ds,ax
		mov si,0
		call show_str
										
		mov a]]></description><category></category></item><item><title><![CDATA[<Fundamentals of Data Structures in C> 2.8 附加习题]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/69890979</link><guid>https://blog.youkuaiyun.com/juwong/article/details/69890979</guid><author>juwong</author><pubDate>Sun, 09 Apr 2017 19:24:24 +0800</pubDate><description><![CDATA[【习题9】随机漫步 random walk问题


#include 
#include 
#include 

#define MAX_N 50
#define MAX_ITERATION 50000

int wander[MAX_N][MAX_N] = {0};
int imove[] = {-1, 0, 1, 1, 1, 0, -1, -1};
int jmove[] = {1, 1]]></description><category></category></item><item><title><![CDATA[<Fundamentals of Data Structures in C> 1.5 性能测量 习题5]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/63253888</link><guid>https://blog.youkuaiyun.com/juwong/article/details/63253888</guid><author>juwong</author><pubDate>Sat, 18 Mar 2017 14:43:06 +0800</pubDate><description><![CDATA[将顺序查找函数的迭代程序（程序1-24）转换成等价的递归程序，测量其性能。


#include 
#include 

#define MAX_SIZE 10001
#define ITERATION 13

int seqsearch(int *,int,int);
int seqsearch2(int *,int,int);

int main(void){
	int n_size[]]]></description><category></category></item><item><title><![CDATA[<Fundamentals of Data Structures in C> 1.4.3 渐进记号]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/61931643</link><guid>https://blog.youkuaiyun.com/juwong/article/details/61931643</guid><author>juwong</author><pubDate>Mon, 13 Mar 2017 21:59:05 +0800</pubDate><description><![CDATA[【例1-20】全排列的时间复杂度O（n*(n!)）


#include 
#include 

#define SWAP(A,B,C) ((C = A),(A = B),(B = C))

void perm(char *,int,int);

int main(void){
	char *list = "abcdefghijklmn";
	int len = strlen(list);
]]></description><category></category></item><item><title><![CDATA[<Fundamentals of Data Structures in C> 1.2 算法描述 2]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/61626774</link><guid>https://blog.youkuaiyun.com/juwong/article/details/61626774</guid><author>juwong</author><pubDate>Sun, 12 Mar 2017 19:17:24 +0800</pubDate><description><![CDATA[【练习10】
Ackerman函数的递归实现与迭代实现。Ackerman(4,1)以上都无法计算出来。
原文地址：http://blog.youkuaiyun.com/pku_zzy/article/details/51933791
1、递归实现
int ack(int m,int n)
{
    if (m==0)
        return n+1;
    else if (n==0)
  ]]></description><category></category></item><item><title><![CDATA[<Fundamentals of Data Structures in C> 1.2 算法描述]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/60475205</link><guid>https://blog.youkuaiyun.com/juwong/article/details/60475205</guid><author>juwong</author><pubDate>Sun, 05 Mar 2017 22:03:14 +0800</pubDate><description><![CDATA[【习题2】


霍纳规则 Horner's method：
用来简化朴素多项式的求值，在中国叫秦九韶算法。
霍纳规则是一种将一元n次多项式求值问题转化为n个一次式算法。其大大简化了计算过程，即使在现代，利用计算机解决多项式的求值问题时，霍纳规则依然是最优的算法规则。
霍纳规则是采用最少的乘法运算策略，求多项式A(x) = anxn+ an-1xn-1+...+
 a1x + a0在x]]></description><category></category></item><item><title><![CDATA[<The C programming language> 语言测试]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/57525579</link><guid>https://blog.youkuaiyun.com/juwong/article/details/57525579</guid><author>juwong</author><pubDate>Sun, 26 Feb 2017 22:29:06 +0800</pubDate><description><![CDATA[测试以下内容：
1、三字符序列；
2、wchar_t
3、打印输出g/p/o/x


#include 
#include 

int main(void)
{
	double a;
	int *pi,buf[20];
	int no;
	wchar_t chi;
	chi = '鬼';
	printf("鬼 = %c\t??=#??/n%d\n",chi,chi);
	pi = bu]]></description><category></category></item><item><title><![CDATA[<The C programming language> 5.11 函数指针 “函数名称就是函数的地址？”]]></title><link>https://blog.youkuaiyun.com/juwong/article/details/55802759</link><guid>https://blog.youkuaiyun.com/juwong/article/details/55802759</guid><author>juwong</author><pubDate>Sun, 19 Feb 2017 14:45:29 +0800</pubDate><description><![CDATA[qsort1((void **) lineptr, 0, nlines - 1, (int (*)(void *, void *))(numeric ? numcmp : strcmp));


Wedit output window build: Sun Feb 19 10:26:10 2017
Error h:\c_workcarbin\mytest.c: 26  operands o]]></description><category></category></item></channel></rss>