递归练习--递归方法插入数据

标签：数据结构   递归   

#include <iostream>
#include <vector>

using namespace std;

void print(char*,int);
void InsertIntoVector(char*,int);
void PrintVector();
void Insertion(char c,int start, int end);
vector<char>VecChar;

int main(int argc, char* argv[])
{
    char str[1000];
    int len;
    VecChar.clear();
    while(1)
    {
            cout<<endl;
            fgets(str,sizeof(str),stdin);
            len = strlen(str);
            print(str,len);
            InsertIntoVector(str,len);
            
            PrintVector();
            
    }
    return 0;    
}

void print(char* str,int n)
{
     for(int i=0; i<n; i++)
     {
          cout<<str[i];
     }
}

void InsertIntoVector(char* str,int n)
{
     int VectorSize;
     //cout << str <<endl;
     for(int i=0; i<n; i++)
     {
             VectorSize = VecChar.size();
             //cout<< VectorSize <<endl;
             if(VectorSize <1)
             {
                  VecChar.push_back(str[i]);
             }
             else if(str[i] <= VecChar[VectorSize/2])
             {
                  Insertion(str[i],0,VectorSize/2);
             }
             else
             {
                 Insertion(str[i],VectorSize/2+1,VectorSize);                 
             }
     }
}

void Insertion(char c,int start, int end)
{
     //cout <<"start:"<<start<<"end:"<<end<<endl;
     if(start == end)
     {
      
         vector<char>::iterator it;
         it = VecChar.begin()+start;
         //if(c<*it)
                 VecChar.insert(it,c);
         //else
           //      VecChar.insert(it+1,c);
      
      /*
         while()
         {
          
         }     
     */
         return;     
     }
     int mid = (start+end)/2;
     if(c <= VecChar[mid])
     {
          Insertion(c,start,mid);
     }
     else
     {
         Insertion(c,mid+1,end);
     }
}

void PrintVector()
{
     int size = VecChar.size();
     cout << size <<endl;
     cout <<"print vector" <<endl;
     for(int i=0; i<size; i++)
     {
        cout<<VecChar[i];
     } 
     //cout <<endl<<" +++++==++++=" <<endl;
}

递归练习--递归方法插入数据

标签：数据结构   递归   

原文地址：http://blog.csdn.net/kee131/article/details/41962567