<bean id="matchNameInterceptor"
          class="org.springframework.transaction.interceptor.NameMatchTransactionAttributeSource">  //通过名称来进行匹配，以及transactiondefinition 
        <property name="properties">
            <props>
                <prop key="get*">PROPAGATION_REQUIRED,readOnly</prop>
                <prop key="find*">PROPAGATION_REQUIRED,readOnly</prop>
                <prop key="load*">PROPAGATION_REQUIRED,readOnly</prop>
                <prop key="insert*">PROPAGATION_REQUIRED</prop>
            </props>
        </property>
    </bean>
    <bean id="transactionInterceptor"
          class="org.springframework.transaction.interceptor.TransactionInterceptor">  //事务的 interceptor 
        <property name="transactionManager" ref="transactionManager"/>
        <property name="transactionAttributeSource" ref="matchNameInterceptor"/>
    </bean>

    
    <bean id="autoProxyCreator"
          class="org.springframework.aop.framework.autoproxy.BeanNameAutoProxyCreator">  //最关键的~~自动对所列表的bean进行装配,
        <property name="interceptorNames">
            <list>
                <idref local="transactionInterceptor"/>    //将interceptor 和bean联合起来 所需要装配的interceptor ，也可以是其他的interceptor 
            </list>
        </property>
        <property name="beanNames">
            <list>
                <idref local="iThreadManager"/>  //这里为需要装配的bean 的list 
                <idref local="iUserManager"/>
            </list>
        </property>
    </bean>

有不对的地方～欢迎各位大大指教

//selection sort---------------------------------------------------------------------
void selectionSort(int v[],int len){
 int k,j,i; 
 for (j=0;k=j,j<=len;j++)
 {
  for (i=j;i<=len;i++) 
   if(v[k]>v[i])k=i;
  if(k!=j) 
  swap(v[k],v[j]); 
 }
}
//selection sort---------------------------------------------------------------------

void quickSort(int v[],int low ,int high)
{
 int tempPos;
 if (low<high)
 {
  tempPos=partition(v,low,high);
  quickSort(v,low,tempPos-1);
  quickSort(v,tempPos+1,high);
 }

}

void main()
{
int i;
int R[11]={-1,7,12,3,5,8,6,2,9,14,11};
for(i=0;i<=10;i++)
cout << R[i] << endl ;
quickSort(R,1,10);
for(i=0;i<=10;i++)
cout << R[i] << endl ;
}