递归_分而治之【二段细分数据（同时进行！）】

#include <iostream>

using namespace std;

const int Len = 66;
const int Divs = 6;

void Subdivide(char ar[], int low, int high, int level);

extern int main01()
{
    char ruler[Len];
    int i;
    for(i = 1; i < Len - 2; i ++)
        ruler[i] = ' ';
    ruler[Len-1] = '\0';
    int max = Len-2;
    int min = 0;
    ruler[max] = ruler[min] = '|';
    cout << ruler << endl;

    for(i = 1; i < Divs; i++)
    {
        Subdivide(ruler, min, max, i);
        cout << ruler << endl;
        for( int j = 1; j < Len - 2 ; j ++)
        {
            ruler[j] = ' ';
        }
    }
    return 0;
}


void Subdivide(char ar[], int low, int high, int level)
{
    if(level == 0)
        return;
    int mid = (low + high) / 2;
    ar[mid] = '|';

    Subdivide(ar, low, mid, level-1);
    Subdivide(ar, mid, high, level-1);
}