- 博客(9)
- 收藏
- 关注
RSS订阅
1原创 【无标题】
#include using namespace std; #define MAX 1000 struct linkman { string name; int sex; //1-男 2-女 int age; string tell; string address; }; struct address_list { int size; struct linkman arr[MAX]; }; void addLinkman(address_list* abs) { cout << “请输入姓
2021-11-28 23:04:56
604
原创 java-数据结构-栈工具类-括号匹配
import java.util.Iterator; public class Stack<T> implements Iterable<T> { private int n; private Node head; private class Node { private T item; private Node next; public Node(T item, Node next) { this.item = item; Node nextN
2021-05-07 23:36:04
129
原创 数据结构-java-快速排序-工具类
package itheima06; public class Quick { public static boolean judge(Comparable s1,Comparable s2) { return s1.compareTo(s2)<0; } public static void exchange(Comparable[] a, int i, int j) { Comparable temp = a[i]; a[i] = a[j]; a[j] = temp;
2021-04-27 23:49:53
137
原创 java-数据结构-归并排序-工具类
package itheima05; public class Merging { private static Comparable[] assist; public static void sort(Comparable[] a) { assist = new Comparable[a.length]; int low = 0; int high = a.length - 1; sort(a, low, high); } public static void sort(
2021-04-27 00:13:36
92
原创 java数据结构
@java 数据结构 希尔排序 public class Shell { public static void sort(Comparable[] a) { int h = 1; while (h < a.length) { h = h * 2 + 1; } while (h >= 1) { for (int i = h; i < a.length; i++) { for (int j = i; j >= h; j -= h) { if
2021-04-24 00:17:57
56
原创 Java数据结构--插入排序
@java数据结构----插入排序 数据结构 算法 这里是引用 public static void sort(Comparable[] a) { for (int i = 1; i < a.length; i++) { for (int j = i; j > 0; j--) { if (judge(a[j - 1], a[j])) { exchange(a, j - 1, j); } else { break; } } }
2021-04-22 23:47:50
52
原创 数据结构-Selection-sort
#Selection sort`` #@选择排序--java版 package itheima02; public class Selection { public static void sort(Comparable[] a) { /*排序算法*/ for (int i = 0; i < a.length - 1; i++) { int Mindex = i; for (int j = i; j < a.length; j++) { if (judge(a[
2021-04-21 23:06:59
48
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人