<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[uTank_yu]]></title><description><![CDATA[每一个你不满意的现在，都有一个你没有努力的曾经。]]></description><link>https://blog.youkuaiyun.com/utank_yu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; utank_yu]]></copyright><item><title><![CDATA[shell 词频]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/10243445</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/10243445</guid><author>utank_yu</author><pubDate>Fri, 23 Aug 2013 23:59:20 +0800</pubDate><description><![CDATA[摘自《Linux Shell 脚本攻略》一书：


#!/bin/bash
#filename : word_freq.sh

if [ $# -ne 1 ];
then
echo "Usage : $0 filename"
exit -1
fi

filename=$1

egrep -o "\b[[:alpha:]]+\b" $filename | \

awk '{ count[$0]]]></description><category></category></item><item><title><![CDATA[安装ubuntu后，无法调节屏幕亮度问题解决]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/9531765</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/9531765</guid><author>utank_yu</author><pubDate>Sat, 27 Jul 2013 18:38:42 +0800</pubDate><description><![CDATA[解决方法：
1.修改/etc/default/grub文件，
把GRUB_CMDLINE_LINUX=””修改为GRUB_CMDLINE_LINUX=”acpi_osi=Linux”然后sudoupdate-grub。
重启后，可使用Fn+ '左右方向键'调节亮度。


2.解决reboot后无法保存屏幕亮度：
修改文件：sudovim /etc/rc.local
在exit0之前]]></description><category></category></item><item><title><![CDATA[非递归中序遍历二叉树（图解）]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/9323361</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/9323361</guid><author>utank_yu</author><pubDate>Sun, 14 Jul 2013 11:22:31 +0800</pubDate><description><![CDATA[本文参考：http://www.slyar.com/blog/bitree-unrecursion-c.html]]></description><category></category></item><item><title><![CDATA[非递归前序遍历二叉树（图解）]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/9317021</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/9317021</guid><author>utank_yu</author><pubDate>Sat, 13 Jul 2013 10:16:10 +0800</pubDate><description><![CDATA[图解二叉树的非递归遍历



1.




2.



3.




4.




5.




6.




7.




9.




11.




12.




13.




14.




15.




16.




17.]]></description><category></category></item><item><title><![CDATA[插入排序（Python版）]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/9102617</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/9102617</guid><author>utank_yu</author><pubDate>Sat, 15 Jun 2013 18:34:20 +0800</pubDate><description><![CDATA[/* */
def insertion_sort(list):
    # Start at the second element (pos 1).
    # Use this element to insert into the
    # list.
    for keyPos in range(1, len(list)):
        # Get the value of the]]></description><category></category></item><item><title><![CDATA[选择排序（Python版）]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/9102607</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/9102607</guid><author>utank_yu</author><pubDate>Sat, 15 Jun 2013 18:31:29 +0800</pubDate><description><![CDATA[/* 选择排序 */

def selection_sort(list):
    # Loop through the entire array
    for curPos in range( len(list) ):
        # Find the position that has the smallest number
        # Start with the curr]]></description><category></category></item><item><title><![CDATA[希尔排序]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/9000931</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/9000931</guid><author>utank_yu</author><pubDate>Fri, 31 May 2013 15:50:40 +0800</pubDate><description><![CDATA[/* */
void shell_sort_0(int array[], int num)
{
    int i, j, gap, tmp;
    gap = num / 2;

    while(gap > 0)
    {
        for(i=gap; i<num; i++)
        {
            j = i - gap;
            whil]]></description><category></category></item><item><title><![CDATA[ARM中的堆栈形式]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/8989416</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/8989416</guid><author>utank_yu</author><pubDate>Wed, 29 May 2013 14:53:07 +0800</pubDate><description><![CDATA[1、寄存器 R13在ARM指令中常用作堆栈指针 

　　2、对于R13寄存器来说，它对应6个不同的物理寄存器，其中的一个是用户模式与系统模式共用，另外5个物理寄存器对应于其他5种不同的运行模式。采用以下的记号来区分不同的物理寄存器：R13_其中，mode为以下几种模式之一： usr、fiq、irq、svc、abt、und。


　　3、寄存器R13在ARM指令中常用作堆栈指针，但这只是一]]></description><category></category></item><item><title><![CDATA[堆排序]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/8982839</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/8982839</guid><author>utank_yu</author><pubDate>Tue, 28 May 2013 08:54:53 +0800</pubDate><description><![CDATA[void minHeapFixDown(int a[], int i, int n) /* 从第i个结点开始调整以i为根的树 */
{
     int j, tmp;

     tmp = a[i]; /* 把i抽出,挖坑 */
    
     j = 2 * i + 1; /* 左孩子 */
     while(j < n)
     {
          if(j+1 < n &&]]></description><category></category></item><item><title><![CDATA[字符串转化atoi、atof]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/8970712</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/8970712</guid><author>utank_yu</author><pubDate>Sat, 25 May 2013 00:12:05 +0800</pubDate><description><![CDATA[/* 将str转换为整型 */
int atoi(char *str)
{
	int i;
	int n, sign;
	for(i = 0; isspace(str[i]); i++)
		;
	sign = (str[i] == '-') ? -1 : 1;
	if(str[i] == '+' || str[i] == '-')
		i++;
	for(n = 0; isdigit(str[]]></description><category></category></item><item><title><![CDATA[选择排序]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/8970328</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/8970328</guid><author>utank_yu</author><pubDate>Fri, 24 May 2013 15:49:54 +0800</pubDate><description><![CDATA[/* */
void select_sort(int a[], int n)
{
	int i, j;
	int min, tmp;
	for(i = 0; i < n-1; i++) /* 选择的次数 */
	{
		min = i;
		for(j = i+1; j < n; j++) /* 选择出最小的 */
		{
			if(a[min] > a[j])
			{
				min =]]></description><category></category></item><item><title><![CDATA[插入排序]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/8970311</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/8970311</guid><author>utank_yu</author><pubDate>Fri, 24 May 2013 15:43:48 +0800</pubDate><description><![CDATA[/* */
void insert_sort(int a[], int n)
{
	int i, j, tmp;
	for(i = 1; i < n; i++)
	{
		tmp = a[i];
		for(j = i -1; j >=0 && a[j] > tmp; j--)
		{
			a[j+1] = a[j];
		}
		a[j+1] = tmp;
	}
}]]></description><category></category></item><item><title><![CDATA[快速排序]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/8967717</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/8967717</guid><author>utank_yu</author><pubDate>Thu, 23 May 2013 22:59:48 +0800</pubDate><description><![CDATA[/* 分区操作 */
int partition(int a[], int left, int right)
{
	int tmp = a[left];
	while(left < right)
	{
		while(left = tmp)
			right--;
		if(left < right)
			a[left++] = a[right];
		while(left < right &]]></description><category></category></item><item><title><![CDATA[单链表基本操作以及一些常见的面试问题]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/8963585</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/8963585</guid><author>utank_yu</author><pubDate>Thu, 23 May 2013 14:52:36 +0800</pubDate><description><![CDATA[/*  线性表的链式存储结构 */

typedef int ElemType;
typedef int Status;
typedef struct LNode{
    ElemType data;
    struct LNode *next;
}LNode, *LinkList;



/* 将单链表初始化为空, 动态生成一个头结点, 并将头结点的指针域置为空 */
Statu]]></description><category></category></item><item><title><![CDATA[Ubuntu下搭建TQ2440的程序下载环境]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/6339404</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/6339404</guid><author>utank_yu</author><pubDate>Thu, 21 Apr 2011 18:22:00 +0800</pubDate><description><![CDATA[<br /><br />我使用的ubuntu10.04，以下是我搭建实验环境的过程，其他版本的ubuntu其搭建过程可能会略有不同，请读者自行查阅相关资料解决。<br />1.必须使用一款类似于windows下SecureCRT的软件：minicom。先下载minicom：<br />sudo apt-get install minicom<br />安装完毕之后，使用如下命令行测试一下：<br />sudo minicom -s<br />会出现如下结果：<br />            +-----[]]></description><category></category></item><item><title><![CDATA[Linux面试题与答案 ]]></title><link>https://blog.youkuaiyun.com/utank_yu/article/details/6114605</link><guid>https://blog.youkuaiyun.com/utank_yu/article/details/6114605</guid><author>utank_yu</author><pubDate>Tue, 04 Jan 2011 00:46:00 +0800</pubDate><description><![CDATA[<br />一．填空题：<br />
1. 在Linux系统中，以 文件
 方式访问设备 。<br />
2. Linux内核引导时，从文件/etc/fstab
 中读取要加载的文件系统。<br />
3. Linux文件系统中每个文件用i节点
 来标识。<br />4. 全部磁盘块由四个部分组成，分别为引导块 、专用块 、 i节点表块 和数据存储块
。<br />
5. 链接分为： 硬链接 和 符号链接
。<br />
6. 超级块包含了i节点表 和 空闲块表
 等重要的文件系统信息]]></description><category></category></item></channel></rss>