zlQQhs（莫落）的专栏

#include "stdafx.h" #include #define DATA_SIZE 14 void BubbleSort1(int data[], int iDataSize) { int iTemp = 0; int iCompareCount = 0; int iMoveCount = 0; for ( int i = 0; i < iDataSize - 1; i++

#include "stdafx.h" #include #define DATA_SIZE 14 void merging(int *pList1, int list1_size, int *pList2, int list2_size) { int i = 0; int j = 0; int k = 0; int m = 0; int temp[DATA_SIZE]; wh

#include "stdafx.h" #include #define DATA_SIZE 14 void insertSort(int data[], int iDataSize) { int iTemp = 0; int j = 0; for ( int i = 1; i < iDataSize; i++ ) { if ( data[i] < data[i - 1] )

#include "stdafx.h" #include #define DATA_SIZE 14 void shellSort(int data[], int iDataSize) { int iTemp = 0; int j = 0; int iGap = iDataSize; do { iGap = iGap / 3 + 1; for ( int i = iGap

#include "stdafx.h" #include #define DATA_SIZE 14 void swap(int data[], int i, int j) { int iTemp = data[i]; data[i] = data[j]; data[j] = iTemp; } int partition(int data[], int iLow, int iHigh)

八大排序算法图文讲解：http://www.cricode.com/3212.html

#include "stdafx.h" #include #define DATA_SIZE 14 void selectSort(int data[], int iDataSize) { int iMinValueIndex = 0; int iTemp = 0; int iCompareCount = 0; int iMoveCount = 0; for ( int i = 0

1.有两条直线Line1和Line2，已经Line1的斜率为d，Line1和Line2之前的夹角为A 设Line2的斜率为k，则有关系如下： tanA = | (d - k) / (2 * d * k)| 2.有三条直线Line1，Line2，Line3，已知Line1和Line3关于Line2对称， Line1的斜率为k1，Line2的斜率为k2，设Line3的斜率为k3，则有关

http://bbs.fishc.com/thread-59615-1-2.html