Location:
Search - heap text
Search list
Description: flash的遮罩文字，希望对大家有帮助。-flash cavity遮罩text ，希望ground submerged mold bleed at the nose助heap 。
Platform: |
Size: 4096 |
Author: 段段 |
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: c 代码 用串的堆分配存储结构来实现小文本编辑器 不需要密码 就可以轻松解压-c code using strings of heap allocated storage structure to achieve a small text editor does not require a password can easily extract
Platform: |
Size: 1024 |
Author: fu xingyou |
Hits:
Description: c 代码 用串的堆分配存储结构来实现小文本编辑器 不需要密码 就可以轻松解压-c code using strings of heap allocated storage structure to achieve a small text editor does not require a password can easily extract
Platform: |
Size: 1024 |
Author: fu xingyou |
Hits:
Description: 1. 此程式執行將從路徑讀取一個文字檔 ( 路徑：C:INPUT.TXT )
2. 執行結束會產生一個排序後的文字檔 ( 路徑：C:OUTPUT.TXT )
3. 給定的初始盤面一定有解
本程式採用的演算法策略為Best-first search with branch-and-bound algorithm
1. 使用Max heap 實作Priority queue
2. 使用bound function 估計目前盤面走至答案最少需要幾步
第一部分
所謂 heap property (或稱 heap condition) 是指每個 node 內的資料比它左右兩側 child nodes 內的資料都小 (但左右兩 child nodes 之間並無一定的關係)。
雖說 heap 在觀念上是一棵 complete binary tree, 實際上是存在一個陣列當中 root 存在 A[1], 接下來將 A[2] 與 A[3] 由左到右依序補滿第二層, 再將 A[4], A[5], A[6], A[7] 由左到右依序補滿第三層…。-1. This program is running from the path to read a text file (path: C: INPUT.TXT)
2. Implementation of the end will produce a sorted text file (path: C: OUTPUT.TXT)
3. Given the initial disk of at least one solution
The program uses the algorithm strategy Best-first search with branch-and-bound algorithm
1. Using the Max heap implement Priority queue
2. Bound function is estimated using the disk at least a few steps away to answer
The first part
The so-called heap property (or called heap condition) refers to the information within each node than its left and right child nodes of the information is small (about two child nodes, but there is no necessary relationship between).
Although the concept of heap is a complete binary tree, in fact there exist root among an array A [1], then the A [2] and A [3] from left to right order of fill over the second layer, then A [4], A [5], A [6], A [7] from left to right order of filling up the third tier ....
Platform: |
Size: 2048 |
Author: zelda |
Hits:
Description: 对文字的识别，能快速地堆文字进行分离识别-Identification of the text, the text can be separated quickly identify the heap
Platform: |
Size: 857088 |
Author: hjj |
Hits:
Description: 利用堆、霍夫曼树、二叉树遍历等知识点，编写文本压缩程序，实现文本文件的压缩与解压功能-Using heap, Hoffman tree, binary tree traversal and other knowledge, text compression program, realize a text file compression and decompression functions
Platform: |
Size: 31744 |
Author: |
Hits:
Description: 根据菜单选择进行文本文档内字母由小到大排序的c program。其中包含1.Insertion Sort. 2.Selection Sort. 3.Merge Sort. 4.Heap Sort. 5.Quick Sort.5种排序功能。-According to the menu to select letters from small to big c program to sort a text document. Which contains 1.Insertion the Sort. 2.Selection the Sort 3.Merge the Sort 4.Heap the Sort. 5.Quick Sort.5 sort function.
Platform: |
Size: 3072 |
Author: s |
Hits:
Description: 读取文本中的学生成绩信息，实用堆排序输出成绩前三名的学生信息-Read the text of student achievement information, practical heap sort output scores of the top three student information
Platform: |
Size: 541696 |
Author: julia |
Hits:
Description: "rmdup" removes all the duplicate lines of a text file (or stdin), and output in the same order as input. Functions like sort+uniq, without changing the line order.
=====================
Motivation: When using zsh, one might wish not to record the commands which are already in history. Unfortunately, the zsh stores the command history instantly, therefore only the continuous duplicate lines would be discarded. With sort+uniq, the original order will be lost, and sometimes it crashes with encoding problem.
=====================
Algorithm: “rmdup” first (heap) sorts the lines (of a text file or from stdin) according to the text and delete/keep the duplicate lines like "uniq". Then it (heap) sorts the output according to the input order.
=====================
The source code is compressed with two precompiled binaries, the MacOS X 10.9 and Ubuntu 11 on Linux 3.0.0.14 (64 bit).
Platform: |
Size: 37888 |
Author: 孙谨 |
Hits: