![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
xiaoyukid
这个作者很懒,什么都没留下…
展开
-
队列学习笔记
循环队列进队列1.先 把值放入 r 。2. r = (r+1)%len 。出队列1. f = (f+1)%len。队列是否为空1.rear = front。队列是否满少用一个元素if( (r+1)%len == f) 满;else不满;代码如下# include # include # include typedef st原创 2012-01-20 10:27:56 · 461 阅读 · 0 评论 -
排序算法之插入排序
# include void insertSort(int * a);int main(void){ int i; int a[6] = {2,5,0,1,4,3}; for(i=0; i<6; i++) printf("%d ",a[i]); printf("\n"); insertSort(a); for(i=0; i<6; i++) printf("%d ",原创 2012-02-03 14:59:08 · 534 阅读 · 0 评论 -
排序算法之归并排序
package org.SORT;public class mergeSort { public static void main(String[] args) { int a[] = {2,4,1,6,78,43,11,57,-2,33,21,58,99,123,53,643,77,40,333,78,8,17}; int t[] = new int[22]; for(int原创 2012-02-05 20:33:48 · 441 阅读 · 0 评论 -
排序算法之谢尔排序
package org.SORT;public class shellSort { public static void main(String[] args) { int a[] = {2,4,1,6,78,43,11,57,-2,33,21,58,99,123,53,643,77,40,333,78,8,17}; for(int i=0; i<a.length; i++ )原创 2012-02-04 15:39:26 · 1000 阅读 · 0 评论 -
排序算法之快速排序
public class quickSort { public static void main(String[] args) { int a[] = {2,4,1,6,78,43,11,57,-2,33,21,58,99,123,53,643,77,40,333,78,8,17}; for(int i=0; i<a.length; i++ ) System.out.print(原创 2012-02-07 21:30:59 · 516 阅读 · 0 评论