qq_41006598的博客

一：插入排序 将第一个元素看作有序序列，将后续元素依次插入，比较条件中不包含等于，所以是一种稳定的算法。无哨兵：#include <stdio.h>void insertSort(int a[],int n);void print(int a[],int n);void print(int a[],int n){ for(int i=0;i<n;i++){ printf(" %d",a[i]); } printf("\n");}...

#include<stdio.h>#include<malloc.h>#define MAXSIZE 100typedef struct { char name[20]; double score; char sno[20];}student;typedef struct { student *elem; int length;}Seqlist;...

package com.imooc.ten;import java.util.Arrays;public class XuanZeRecursion { public static int[] selectionSort(int[] array,int minIndex) { int mid=minIndex; if (minIndex==array.length)...

package com.imooc.ten;import java.util.Arrays;public class MaoPaoRecursion { public static int[] bubbleSort(int[] array,int size) { //boolean flag=true; if (size== 0) ret...

#include<stdio.h>#include<malloc.h>typedef struct { char name[20]; double score; char sno[20];}student;typedef struct LNode{ student data; //数据域 struct LNode *ne...