五种程序设计语言创建数组

下文将实现分别用如下五种程序设计语言创建数组，通过希尔排序后输出结果

C

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

//生成随机数
void Random_Number(int arr[], int iNum) {
	srand(time(NULL));
	for(int i = 0; i < iNum; i++) {
			arr[i] = rand();
	}
}

//希尔排序 
void Shell_Sort(int arr[], int len) {
	int tmp; 
	int i,j;
	
	for (int step = len/2; step > 0; step/=2) {		//设置步长 
		for(i = step; i < len; i++) {			//从数组内的step元素开始 
			tmp = arr[i];
			for (j = i - step;(j>=0 && arr[j] > tmp);j -= step) { //对组内元素进行直接插入排序法 
				arr[j+step] = arr[j];
			}
			arr[j+step] = tmp;
		}
	}
}

//输出数组
void Print(int arr[], int len) {
	int i;
	for (i = 0; i < len - 1; i++) {
		printf("%d ", arr[i]);
	}
	printf("%d\n", arr[i]);
}

int main() {
	int iNum;

	printf("\nPlease enter the number of random integers generated: ");
	scanf("%d",&iNum);

	int iData[iNum];

	Random_Number(iData, iNum); // 产生要求个数的随机整数数列
	Shell_Sort(iData, iNum); // 将数列进行升序排序
	Print(iData, iNum); // 输出序列
	return 0;
}

C++

#include <iostream>
#include <stdlib.h>
using namespace std;

// 希尔排序函数
void ShellSort(int array[], int n) {  
	int i, j, step;
	for (step = n / 2; step > 0; step = step / 2)  //这里的step步长是根据10个元素这种情况定义的
	{
		for (i = 0; i < step; i++)  //i是子数组的编号
		{
			for (j = i + step; j < n; j = j + step)  //数组下标j，数组步长下标j+step
			{
				if (array[j] < array[j - step])
				{
					int temp = array[j];  //把数组下标j的值放到temp中
					int k = j - step;
 
					while (k >= 0 && temp < array[k])
					{
						array[k + step] = array[k];  //把大的值往后插入
						k = k - step;
					}
					array[k + step] = temp;  //把小的值往前插入
				}
			}
		}
	}
}
 
  // 主程序
int main(void)  {
	const int n = 10;  //数组元素的数量
	int array[n];
	cout << "请输入10个整数：" << endl;
	for (int i = 0; i < n; i++) {
		cin >> array[i];
	}
 
	cout << endl;  //换行
 
	ShellSort(array, n);  // 调用BubbleSort函数  进行比较
 
	cout << "由小到大的顺序排列后：" << endl;
	for (int i = 0; i < n; i++) {
		cout << "Array" << "[" << i << "]" << " = " << array[i] << endl;
	}
 
	cout << endl << endl;  //换行
 
	system("pause");  //调试时，黑窗口不会闪退，一直保持
	return 0;
}

C#

    #include "iostream"

    using namespace std;

    #define N 9
    #define MAXSIZE 10
    #define OK 1
    #define ERROR 0
    #define TRUE 1
    #define FALSE 0

    typedef int Status;
    typedef struct{
        int r[MAXSIZE+1];
        int len;
    }Sqlist;

    void show(Sqlist L){
        for(int i = 1; i <= L.len; i++)
            cout << L.r[i] << " ";
        cout << endl;
    }

    // 希尔排序
    void ShellSort(Sqlist *L){
        int i, j;
        int increment = L->len;  // 增量的初始化
        do{ // 每执行一次do-while循环就会生成一个子序列，每个子序列的生成使用的增量increment是不同的！但是序列将原来越来越朝着基本有序的方向发展
            increment = increment / 3 +1;
            for(i = increment+1; i <= L->len; i++){
                if(L->r[i] < L->r[i-increment]){  // 插入的元素是L->r[i]，进行比较
                    L->r[0] = L->r[i];   // 将需要的插入的元素暂时存储在哨兵中
                    for(j = i-increment; j>0 && L->r[j] > L->r[0];j-=increment)
                        L->r[j+increment] = L->r[j];   // 进行交换操作
                    L->r[j+increment] = L->r[0];
                }  
            }
        }while(increment > 1);  // 跳跃式的移动，而直接排序中是使用increment=1固定的！
    }

    int main(){
        Sqlist L;
        int d[N] = {9, 1, 5, 8, 3, 7, 4, 6, 2};
        for(int i = 0; i < N; i++)
            L.r[i+1] = d[i];
        L.len = N;
        cout << "希尔排序前: ";
        show(L);
        cout << "希尔排序后: ";
        ShellSort(&L);
        show(L);
        return 0;
    }

Java

import java.util.Scanner;
import java.util.Random;

public class RandonArray {
	public static void main(String[] args) {
		System.out.print("Please enter the number of random integers generated: ");
		Scanner input = new Scanner(System.in);
		int iNum = input.nextInt();
		int iData[] = new int[iNum];
		Random_Number(iData, iNum);
		Shell_Sort(iData, iNum);
		Print(iData, iNum);
	}
	
	public static void Random_Number(int arr[], int iNum) {
		Random random = new Random();
		for (int i = 0; i < iNum; i++) {
			arr[i] = Math.abs(random.nextInt());
		}
	}
	
	//希尔排序 
	public static void Shell_Sort(int arr[], int len) {
		int tmp; 
		int i,j;
		
		for (int step = len/2; step > 0; step/=2) {		//设置步长 
			for(i = step; i < len; i++) {			//从数组内的step元素开始 
				tmp = arr[i];
				for (j = i - step;(j>=0 && arr[j] > tmp);j -= step) { //对组内元素进行直接插入排序法 
					arr[j+step] = arr[j];
				}
				arr[j+step] = tmp;
			}
		}
	}
	
	//输出数组
	public static void Print(int arr[], int len) {
		int i;
		for (i = 0; i < len - 1; i++) {
			System.out.print(arr[i] + " ");
		}
		System.out.println(arr[i]);
	}
}

Python

def shellSort(arr): 
  
    n = len(arr)
    gap = int(n/2)
  
    while gap > 0: 
  
        for i in range(gap,n): 
  
            temp = arr[i] 
            j = i 
            while  j >= gap and arr[j-gap] >temp: 
                arr[j] = arr[j-gap] 
                j -= gap 
            arr[j] = temp 
        gap = int(gap/2)
  
arr = [ 12, 34, 54, 2, 3] 
  
n = len(arr) 
print ("排序前:") 
for i in range(n): 
    print(arr[i]), 
  
shellSort(arr) 
  
print ("\n排序后:") 
for i in range(n): 
    print(arr[i]),