No self-introduction
Loading
Profile
Follow
codes (6)
Skins Windows Forms program
no vote
Click right button pops up a shortcut menu for a replacement form skin, and in the shortcut menu, select change under the skin of any menu item, the program will replace the current form of the skin
devileragon 0 0
1
Havermann encoding/decoding system
no vote
Design of a Huffman encoding and decoding system. Of characters in a text file to an ASCII-coded for Huffman coding, generate the code files; Conversely, decoding the encoded files can be restored to a text file. 1. initialize. Any read an ASCII-encoded file, statistics, establishment of Huffman trees. 2. encoding. Using established Huffman tree for Huffman code for each character. 3. graphical outputs in the Huffman tree nodes, and Huffman coding. 4. decoding. Decode the input file using Huffman tree has been established and stored as. HUF compressed files. 5. anti-decoding. HUF file decoding encoded in ASCII txt file, compare it with the original txt file.
devileragon 0 0
1
Package class implements a simple calculator
no vote
Calculators can be programmed learning have begun learning to program one of the most common examples, many colleges and universities test student programming abilities, usually written using the calculator to evaluate students. This instance will use the encapsulation in object-oriented programming to write a simple calculator.
devileragon 0 0
1
Hill sort method to sort the one-dimensional array
no vote
Hill sort (Shell Sort) is a kind of insertion sort. Is straight insertion sort algorithm improvements. This method is also known as diminishing increment sort, for DL. Shell in 1959, and named. Hill, this example demonstrates how to use the sort method sorts the one-dimensional array
devileragon 0 0
1
Using quick sort algorithm to sort one array
no vote
Quick sorting (Quicksort) is a modified bubble sort. By c. A. r. Hoare in 1962. Its basic idea is: a trip through the sort to sort the data into two separate parts, a part of all data is smaller than the other all data, then in this way each of the two pieces of data to quickly sort, the entire ordering process can be recursive, to reach the whole data into an ordered sequence.
devileragon 1 0
1
Bubble sort
no vote
Bubble (Bubble Sort), is a relatively simple sorting algorithm in computer science field. It repeatedly visited the sequence to be sorted, comparing two elements at a time, if the errors in the order they'll swap them over. Visit sequence is repeated until there is no more need to Exchange, meaning that the series has been sequenced.
devileragon 0 0
1
No more~
Follows0
Fans0