11 2012 档案

摘要：What's heap ? it's main feature: root is the smallest(largest), nodes with children are larger than children. Root which is the smallest ,called Small Heap. Otherwise, we called it Big Heap if it's largest.we now represent the heap in data stuct of Heap in the way of array.In order to fi 阅读全文

摘要：Why does it call Shell Sort? This time it's name has little to do with the method it uses. In fact , it's alse callDecreasing incremental sorting algorithm (递减增量排序算法)It's because ofDonald Shell, who invented this method:divide List into servral column (first column = length/2)but each ti 阅读全文

摘要：Why does it call insert sort?It's name contains the method it uses.It's basic theory was so simple: Insert a element into a sorted list.But how the sorted list basically initialize ---- build a list with only one element.Here comes the code:#include<stdio.h>#include"type.h"vo 阅读全文

摘要：Why does it call Select Sort ?It's name contains what kind of method it uses:Every time by comparing i_item from bottom to top ,if found smaller one, mark the one.In one loop, one smallest one is found.then , exchange the right position of i_item find smallest in that loop and it's original 阅读全文

摘要：Why it call Bubble Sort? It's name contains what kind of method it uses: Every time by comparing i_item from bottom to top ,if found greater one, i_item raises one step .In one loop, one smallest one is found.Here are the codes://BubbleSort.c#include<stdio.h>#include"type.h"voids 阅读全文