Location:
Search - radix tree
Search list
Description: This function is written to understand and/or explain an fft algorithm and usage of radix2 procedure.
This function take the signal which you want to find FFT, for m bit
you can also call the function without entering a signal or number of points, because there is default values for y and m which are
y = sin(2*pi*50*t)+sin(2*pi*120*t)
m=3
you can see the steps of order reversing used as built-in function but non others. you will also see the taking butterfly tree steps.
for more information read the help file of function.
in future this can be improve as selective radix or any other feature you suggest please notice me for any sugestion.
Platform: |
Size: 2904 |
Author: dairy |
Hits:
Description: This function is written to understand and/or explain an fft algorithm and usage of radix2 procedure.
This function take the signal which you want to find FFT, for m bit
you can also call the function without entering a signal or number of points, because there is default values for y and m which are
y = sin(2*pi*50*t)+sin(2*pi*120*t)
m=3
you can see the steps of order reversing used as built-in function but non others. you will also see the taking butterfly tree steps.
for more information read the help file of function.
in future this can be improve as selective radix or any other feature you suggest please notice me for any sugestion.
Platform: |
Size: 3072 |
Author: dairy |
Hits:
Description: radix sort please accept now mai too tr-radix sort please accept now mai too tree
Platform: |
Size: 3072 |
Author: jonh karp |
Hits:
Description: 二叉树的递归与非递归遍历(Java描述)，高效实现Josephus算法，合并有序链表，基于队列实现的基数排序，栈.回溯.迷宫问题求解。5个算法的源程序。-Recursive and non recursive binary tree traversal (Java description), efficient algorithms to achieve Josephus, merging sorted linked list, queue-based implementation of radix sort, stack. Backtracking. Maze problem-solving. 5 algorithm source code.
Platform: |
Size: 81920 |
Author: liujin |
Hits:
Description: C codes for AVL tree, radix sort, quick sort, binary tree,calculator, dijikstra, swap function-C codes for AVL tree, radix sort, quick sort, binary tree,calculator, dijikstra, swap function....
Platform: |
Size: 10240 |
Author: Swati Chakraborty |
Hits:
Description: A gate level implementation of a Booth Encoded Radix-4 24 bit multiplier with VHDL code in structural form. Carry-save adder and hierarchical CLA adder is used for the component adders in the design. The 12 partial products is a Wallace Adder Tree built from Carry-save adder using 3 to 2 reduction. A hierarchical CLA ( Carry-look-Ahead Adder ) adder is used for the final product generation.
-A gate level implementation of a Booth Encoded Radix-4 24 bit multiplier with VHDL code in structural form. Carry-save adder and hierarchical CLA adder is used for the component adders in the design. The 12 partial products is a Wallace Adder Tree built from Carry-save adder using 3 to 2 reduction. A hierarchical CLA ( Carry-look-Ahead Adder ) adder is used for the final product generation.
Platform: |
Size: 7168 |
Author: Michael Lee |
Hits:
Description: 数据结构基本算法演示程序实现：
1、实现KMP模式匹配算法、哈夫曼编码算法、由遍历序列恢复二叉树、Prim算法、Kruskal算法、Floyd算法、Dijkstra算法、拓扑排序、关键路径算法、二叉排序树生成算法（含平衡化）、哈希表生成及哈希查找算法、希尔排序、快速排序、堆排序、归并排序、基数排序。（四则表达式计算、矩阵运算、有向图的强连通分量求解）
2、算法中的链表结构和数组结构的基本操作要求单独函数实现（同组内算法要求共享使用）。
要求数据结构基本算法演示程序具有菜单选择，算法要有结果的显示形式，显示程序框架
-Basic algorithm demo program data structures to achieve:
1, and KMP pattern matching algorithm, Huffman coding algorithm, the binary tree traversal sequence recovery, Prim algorithm, Kruskal algorithm, Floyd algorithm, Dijkstra algorithm, topological sorting, critical path algorithm, binary sort tree generation algorithm (including the balance of), hash table hash search algorithm generates and Hill sort, quick sort, heap sort, merge sort, radix sort. (D expression computing, matrix operations, have to solve the graph strongly connected components)
2, the algorithm in the list structure and basic operation of the array structure requires a separate function to achieve (within the algorithm requires the same set of shared use.)
Basic algorithm required data structure has the menu to select the demonstration program, the algorithm should have the results display format, display program framework
Platform: |
Size: 20480 |
Author: dark |
Hits:
Description: 内有acm的一些算法，如johnson 算法、radix tree、动态规划、几何-There are some acm algorithm, such as johnson algorithm, radix tree, dynamic programming, geometry, etc.
Platform: |
Size: 1871872 |
Author: 寿成承 |
Hits:
Description: 有符号16位乘法器。经典booth编码。拓扑结构为wallance树。加法器类型是进位选择加法器。-Number system: 2 s complement
Multiplicand length: 16
Multiplier length: 16
Partial product generation: PPG with Radix-4 modified Booth recoding
Partial product accumulation: Wallace tree
Final stage addition: Carry select adder
Platform: |
Size: 49152 |
Author: 周晓生 |
Hits:
Description: 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo.
1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。
已实现 ( Implemented ):
Array shuffle
Prime test(trial division)
Prime test(Miller-Rabin s method)
2D Array
Arbitary Integer
Linear congruential generator
Maximum subarray problem
Bit-Set
Queue
Stack
Binary Heap
Fibonacci Heap
Priority Queue (list based)
Bubble sort
Selection sort
Insertion sort
Radix sort
Quick sort
Merge sort
Heap sort
Double linked list
Skip list
Self-organized linked-list ops (move-to-front, move-ahead-one)
Largest common sequence
Binary search tree
Dynamic order statistics
Red-black tree
Interval tree
Prefix Tree(Trie)
Suffix Tree
B-Tree
Suffix Array等-(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!)
Platform: |
Size: 1636352 |
Author: 汪小君 |
Hits:
Description: The height_to_maxindex array needs to be one deeper than the maximum path as height 0 holds only 1 entry.
Platform: |
Size: 15360 |
Author: biuhdcui |
Hits:
Description: Size of each radix tree node (must be a power of 2). This impacts tree depth.
Platform: |
Size: 2048 |
Author: paifhmh |
Hits:
Description: 基数排序
基数排序（radix sort）属于“分配式排序”（distribution sort），又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的稳定性排序法。
快速排序
快速排序由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。
堆排序
堆排序(Heapsort)是指利用堆积树（堆）这种数据结构所设计的一种排序算法，它是选择排序的一种。可以利用数组的特点快速定位指定索引的元素。堆分为大根堆和小根堆，是完全二叉树。大根堆的要求是每个节点的值都不大于其父节点的值，即A[PARENT[i]] >= A[i]。在数组的非降序排序中，需要使用的就是大根堆，因为根据大根堆的要求可知，最大的值一定在堆顶。
求幂
输入xy 求y的x次方的值-Radix sort
Element assignment radix sort (radix sort) are assigned ordering (distribution sort), also known as bucket Law (bucket sort) or bin sort, as the name suggests, it is part of the information through the key will be sorted to some of the barrel in order to achieve the sort of role, radix sort belongs to the sort of stability, its time complexity is O (nlog (r) m), where r is taken to the base, and m is the heap number, at some point, radix sort efficiency than other sort of stability.
Quick Sort
Fast Sorted by C. A. R. Hoare proposed in 1962. Its basic idea is: a trip by ordering the data to be sorted into separate two parts, one part of all of the data than the other portion of all data should be small, then the data in this way for the two parts separately fast sort, the entire sorting process can be recursively in order to achieve the whole data into an ordered sequence.
Heap sort
Heap sort (Heapsort) refers to a sorting algorithm uses stacked tree (h
Platform: |
Size: 3072 |
Author: 贺敏 |
Hits: