摘要：
#include<stdio.h>void QuickSort(int* a,int low,int high);int FindPos(int* a,int low,int high);int main(){ int a[6]={2,1,0,5,4,3}; int i; QuickSort(a,0 阅读全文
摘要：
#!bin/shcd java设计模式程序源代码for var in * do cd $var for var2 in * do # echo $var"->"$var2 # mv $var2 "c"`echo $var2|sed 's/\.//g'` cd $var2 for var3 in `l 阅读全文
摘要：
#include <stdio.h>#include <stdlib.h>#include<time.h>struct Arr { int *p_base; int len; int cnt;};void init_arr(Arr * pArr, int length);void sort_arr( 阅读全文
摘要：
#include "stdafx.h"int a[] = { 1,2,3,4,5,6,6,5,9,1,2 };int b[] = {5,6};int LEN = sizeof(a) / sizeof(a[0]);void yiwei(int* a,int b) { for (int i = b;i 阅读全文
摘要：
package com.sunyard.utils;import java.util.HashMap;import java.util.Iterator;import java.util.List;import org.jdom.Document;import org.jdom.Element;pu... 阅读全文
摘要：
package datastructure;import java.util.Random;public class Sort { private static int count=1; public static void main(String[] args) { int[] a=new i... 阅读全文
摘要：
package aaa;import java.awt.Color;import java.awt.Container;import java.awt.event.ActionEvent;import java.awt.event.ActionListener;import java.io.Buff... 阅读全文
摘要：
public static void main(String[] args) {int [][] yh=new int[10][];for(short i=0;i<yh.length;i++){yh[i]=new int[i+1];for (int j = 0; j < yh[i].length; ... 阅读全文
摘要：
public static void main(String[] args) {String [][] yh=new String[9][];for(short i=0;i<yh.length;i++){yh[i]=new String[i+1];for (int j = 0; j < yh[i].... 阅读全文