Location:
Search - heap java
Search list
Description: 用java实现的数据结构排序算法，包括：选择排序、插入排序、冒泡排序、希尔排序、快速排序、堆排序、归并排序。-used to achieve the ranking algorithm data structure, including : Select, in order of insertion sequence and Bubble Sort, Hill sequencing, rapid sequencing, heap sort, merging sequencing.
Platform: |
Size: 54226 |
Author: 陈为 |
Hits:
Description: 深入浅出Java堆的管理--垃圾回收-simple Java heap management -- the garbage collector
Platform: |
Size: 6900 |
Author: 赵华 |
Hits:
Description: 深入浅出Java堆的管理--垃圾回收-simple Java heap management-- the garbage collector
Platform: |
Size: 6144 |
Author: 赵华 |
Hits:
Description: 用java实现的数据结构排序算法，包括：选择排序、插入排序、冒泡排序、希尔排序、快速排序、堆排序、归并排序。-used to achieve the ranking algorithm data structure, including : Select, in order of insertion sequence and Bubble Sort, Hill sequencing, rapid sequencing, heap sort, merging sequencing.
Platform: |
Size: 54272 |
Author: 陈为 |
Hits:
Description: HUFFMAN和HEAP的JAVA实现。
用来实现文件压缩的基本部分。-HUFFMAN HEAP and JAVA. Documents used to achieve a fundamental part of compression.
Platform: |
Size: 9216 |
Author: 姚维 |
Hits:
Description: java 排序，冒泡排序，快速排序，选择排序，插入排序，堆排序，归并排序等等！-java ranking, bubble sort, quick sort, select Sort, insert sequencing, heap sort, merge sort, and so on!
Platform: |
Size: 6144 |
Author: 丁如敏 |
Hits:
Description: 许多的排序算法，包括选择排序，堆排序，冒泡排序，折半排序，用java开发。-many of the sorting algorithm, including the option of scheduling, heap sort, Bubble sort, half ranking with java development.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 用java编写的一个演示堆排序算法的代码。
-java with a demonstration of the preparation of the heap sorting algorithm code.
Platform: |
Size: 38912 |
Author: 往往 |
Hits:
Description: 算法中经典问题，排序算法的实现。其中有冒泡、改进的快速、堆、选择排序的实现。-Algorithm in the classical problem of sorting algorithm implementations. Which the bubble has to improve fast, heap, choose to sort of realize.
Platform: |
Size: 1024 |
Author: 莫海波 |
Hits:
Description: 用Java语言实现的各种排序，包括插入排序、冒泡排序、选择排序、Shell排序、快速排序、归并排序、堆排序、SortUtil等-Using Java language to achieve a variety of sorting, including the Insertion Sort, Bubble Sort, Selection Sort, Shell Sort, Quick Sort, Merge Sort, Heap Sort, SortUtil, etc.
Platform: |
Size: 2048 |
Author: 王晓磊 |
Hits:
Description: This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board.
Platform: |
Size: 19456 |
Author: heavenflames |
Hits:
Description: java编写的一个播放器程序，能播放多种文件，希望对大家有所帮助-java met迡cavity temperature ? Xiaqi stamp instance, the most唗Xikui ㄛ Xiaqi温嗣text Gou Qin Li ㄛ洷submerged mode bleed at the nose咡All heap翑
Platform: |
Size: 496640 |
Author: 剑侠 |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: |
Size: 17408 |
Author: 游弋人生 |
Hits:
Description: java中几种常用的排序算法。
用Java语言实现的各种排序，包括插入排序、冒泡排序、选择排序、Shell排序、快速排序、归并排序、堆排序、SortUtil等。-java of several commonly used sorting algorithm. Using Java language to achieve a variety of sorting, including the Insertion Sort, Bubble Sort, Selection Sort, Shell Sort, Quick Sort, Merge Sort, Heap Sort, SortUtil such.
Platform: |
Size: 3072 |
Author: alonso |
Hits:
Description: 包括了5个基本排序过程，快速，冒泡，堆，选择，插入。-Includes five basic sort process, rapid, and bubble, heap, select Insert.
Platform: |
Size: 23552 |
Author: 黄戈 |
Hits:
Description: 数据结构中大根堆的实现，Java语言描述。-Heap
Platform: |
Size: 1024 |
Author: wicool |
Hits:
Description: 通过Java语言实现了选择、插入、冒泡、希尔、快速、归并、堆、基数等8种排序算法-Java based selection, insertion, bubble, shell, quick, merge, heap, radix sorting algorithm
Platform: |
Size: 11264 |
Author: 陈昱安 |
Hits:
Description: A simple implementation of a graph in java with heap and dijkstra algorithm
Platform: |
Size: 3072 |
Author: cascina |
Hits:
Description: 本书共分20章，第1-4章解释了java虚拟机的体系结构，包括java栈、堆、方法区、执行引擎等；第5-20章深入描述了java技术的内部细节，包括垃圾收集、java安全模型、java的连接模型和动态扩展机制、class文件、运算及流程控制等等，其中等6章和附录a-c完全可以作为class文件和指令含集的参考手册深入JAVA虚拟机第二版-This book is divided into 20 chapters, chapters 1-4 explain the java virtual machine architecture, including the java stack, heap, methods area, the execution engine 5-20 chapter in-depth description of the internal details of the java technology, including garbagecollection, the Java security model, Java connection model and the dynamic extension mechanism, the class file, computing and process control, etc., of which 6 and Appendix ac can be used as the class files and instruction set reference manual containing
Platform: |
Size: 19424256 |
Author: 杨庆怡 |
Hits:
Description: 把Heap.java档改写成顺序. 开头的是最小数目,结尾最大.-The Heap.java file rewrite order. In ascending order. The root node is smallest number.
Platform: |
Size: 2048 |
Author: vernon |
Hits: