10 2013 档案

摘要：The picture below is a .X file opened by DirectX Mesh View. Today, we look at the X file's detail information. I strongly recommand readers search "X File Format Reference" topic in DirectX SDK docume... 阅读全文

摘要：Recently,in a project, I try to set a merge labels's background property, the result is: background not showing up. After Checked out on the Internet, I find out what the merge label is. Create a new ... 阅读全文

摘要：Stack1.h#ifndef stack_#define stack_#include "stdafx.h"//#include //using namespace std;//exceptionclass OutOfBounds{public: OutOfBounds(){}};//change array's sizetemplatevoid Changesize1D(T * &arr,c... 阅读全文

摘要：Heaps Heap Definition A max tree(min tree) is a tree in which the value in each node is greater(less) than or equal to those in its children(if any) Building a max heap Look at below figure, we adjus... 阅读全文

摘要：Below is the core code template int Partition(T a[], int p, int r){ int x = a[r]; int i = p - 1; for(int j = p;j using namespace std;template void PrintfNum(T a[], int n);template int Partition(T a... 阅读全文

摘要：Since an array with one element is a sorted array. By insert second element into this one array, we get a sorted array of size 2, Continuing in this way, we obtain a sorted array of size n. // Inserti... 阅读全文

摘要："Bubble Sort" is a simple way to sort elements. This sort employs a "bubbling strategy" to get the largetest element to the right. In a bubbling pass, pairs of adjacent elements are compared, the elem... 阅读全文