Rust:在Rust中实现的所有算法

  • h8_205902
    了解作者
  • 41.1KB
    文件大小
  • zip
    文件格式
  • 0
    收藏次数
  • VIP专享
    资源类型
  • 0
    下载次数
  • 2022-04-29 02:52
    上传日期
Rust:在Rust中实现的所有算法
Rust-master.zip
  • Rust-master
  • git_hooks
  • pre-commit
    21B
  • src
  • searching
  • mod.rs
    127B
  • linear_search.rs
    1.1KB
  • binary_search.rs
    1.4KB
  • README.md
    1.5KB
  • data_structures
  • mod.rs
    230B
  • heap.rs
    4.8KB
  • b_tree.rs
    5.7KB
  • README.md
    955B
  • binary_search_tree.rs
    10.7KB
  • linked_list.rs
    3.5KB
  • string
  • mod.rs
    79B
  • knuth_morris_pratt.rs
    2.4KB
  • README.md
    611B
  • sorting
  • selection_sort.rs
    980B
  • radix_sort.rs
    1.8KB
  • mod.rs
    1.1KB
  • merge_sort.rs
    2.4KB
  • quick_sort.rs
    832B
  • README.md
    7KB
  • insertion.rs
    1.9KB
  • bubble_sort.rs
    718B
  • shell_sort.rs
    1.7KB
  • heap_sort.rs
    3.4KB
  • counting_sort.rs
    2.2KB
  • dynamic_programming
  • mod.rs
    387B
  • longest_common_subsequence.rs
    2.4KB
  • fibonacci.rs
    2.4KB
  • knapsack.rs
    5.1KB
  • edit_distance.rs
    4.8KB
  • egg_dropping.rs
    2.1KB
  • general
  • kmeans.rs
    6.6KB
  • mod.rs
    214B
  • convex_hull.rs
    4.9KB
  • hanoi.rs
    594B
  • ciphers
  • vigenere.rs
    2.2KB
  • mod.rs
    130B
  • caesar.rs
    1.1KB
  • rot13.rs
    692B
  • README.md
    2.7KB
  • lib.rs
    616B
  • Cargo.toml
    126B
  • CONTRIBUTING.md
    826B
  • .travis.yml
    196B
  • LICENSE
    1KB
  • README.md
    2.5KB
  • .gitconfig
    33B
  • .gitignore
    59B
内容介绍
## Sort Algorithms ### [Bubble](./bubble_sort.rs) ![alt text][bubble-image] From [Wikipedia][bubble-wiki]: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. __Properties__ * Worst case performance O(n^2) * Best case performance O(n) * Average case performance O(n^2) ###### View the algorithm in [action][bubble-toptal] ### [Counting](./counting_sort.rs) From [Wikipedia][selection-wiki]: In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct key value, and using arithmetic on those counts to determine the positions of each key value in the output sequence. Its running time is linear in the number of items and the difference between the maximum and minimum key values, so it is only suitable for direct use in situations where the variation in keys is not significantly greater than the number of items. However, it is often used as a subroutine in another sorting algorithm, radix sort, that can handle larger keys more efficiently. __Properties__ * Worst case performance O(n+k) * Best case performance O(n+k) * Average case performance O(n+k), where n is the number of integers to sort and k is the difference between the largest and smallest integer in our list. ### [Insertion](./insertion_sort.rs) ![alt text][insertion-image] From [Wikipedia][insertion-wiki]: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. __Properties__ * Worst case performance O(n^2) * Best case performance O(n) * Average case performance O(n^2) ###### View the algorithm in [action][insertion-toptal] ### [Merge](./merge_sort.rs) ![alt text][merge-image] From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945. __Properties__ * Worst case performance O(n log n) * Best case performance O(n log n) * Average case performance O(n log n) ###### View the algorithm in [action][merge-toptal] ### [Quick](./quick_sort.rs) ![alt text][quick-image] From [Wikipedia][quick-wiki]: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. __Properties__ * Worst case performance O(n^2) * Best case performance O(n log n) or O(n) with three-way partition * Average case performance O(n log n) ###### View the algorithm in [action][quick-toptal] ### [Radix](./radix_sort.rs) ![alt text][radix-image] From [Wikipedia][radix-wiki]: Radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix. For elements with more than one significant digit, this bucketing process is repeated for each digit, while preserving the ordering of the prior step, until all digits have been considered. __Properties__ * Worst case performance O(w*n) where w is the number of bits required to store each key. ### [Selection](./selection_sort.rs) ![alt text][selection-image] From [Wikipedia][selection-wiki]: The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right. __Properties__ * Worst case performance O(n^2) * Best case performance O(n^2) * Average case performance O(n^2) ###### View the algorithm in [action][selection-toptal] ### [Shell](./shell_sort.rs) ![alt text][shell-image] From [Wikipedia][shell-wiki]: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywhere, considering every nth element gives a sorted list. Such a list is said to be h-sorted. Equivalently, it can be thought of as h interleaved lists, each individually sorted. __Properties__ * Worst case performance O(nlog2 2n) * Best case performance O(n log n) * Average case performance depends on gap sequence ###### View the algorithm in [action][shell-toptal] [bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort [bubble-wiki]: https://en.wikipedia.org/wiki/Bubble_sort [bubble-image]: https://upload.wikimedia.org/wikipedia/commons/thumb/8/83/Bubblesort-edited-color.svg/220px-Bubblesort-edited-color.svg.png "Bubble Sort" [counting-wiki]: https://en.wikipedia.org/wiki/Counting_sort [insertion-toptal]: https://www.toptal.com/developers/sorting-algorithms/insertion-sort [insertion-wiki]: https://en.wikipedia.org/wiki/Insertion_sort [insertion-image]: https://upload.wikimedia.org/wikipedia/commons/7/7e/Insertionsort-edited.png "Insertion Sort" [quick-toptal]: https://www.toptal.com/developers/sorting-algorithms/quick-sort [quick-wiki]: https://en.wikipedia.org/wiki/Quicksort [quick-image]: https://upload.wikimedia.org/wikipedia/commons/6/6a/Sorting_quicksort_anim.gif "Quick Sort" [merge-toptal]: https://www.toptal.com/developers/sorting-algorithms/merge-sort [merge-wiki]: https://en.wikipedia.org/wiki/Merge_sort [merge-image]: https://upload.wikimedia.org/wikipedia/commons/c/cc/Merge-sort-example-300px.gif "Merge Sort" [radix-wiki]: https://en.wikipedia.org/wiki/Radix_sort [radix-image]: https://ds055uzetaobb.cloudfront.net/brioche/uploads/IEZs8xJML3-radixsort_ed.png?width=400 "Radix Sort" [selection-toptal]: https://www.toptal.com/developers/sorting-algorithms/selection-sort [selection-wiki]: https://en.wikipedia.org/wiki/Selection_sort [selection-image]: https://upload.wikimedia.org/wikipedia/commons/thumb/b/b0/Selection_sort_animation.gif/250px-Selection_sort_animation.gif "Selection Sort Sort" [shell-toptal]: https://www.toptal.com/developers/sorting-algorithms/shell-sort [shell-wiki]: https://en.wikipedia.org/wiki/Shellsort [shell-image]: https://upload.wikimedia.org/wikipedia/commons/d/d8/Sorting_shellsort_anim.gif "Shell Sort"
评论
    相关推荐
    • rust-soundchange:在 Rust 中实现声音变化算法的工具
      实现声音变化算法的工具。 这是严格按照 Mark Rosenfelder 的建模的,并对 Rust 的宏系统进行了必要的调整。 典型用法及与原SCA规则对比: #[macro_use] extern crate soundchange; #[macro_use] extern crate ...
    • 使用对齐算法比较二进制文件-Rust开发
      为此,它使用了rust-bio库中的生物信息学算法(通常用于DNA序列比对)。 biodiff使用对齐算法比较二进制文件。 这是什么这是用于二进制比较的工具。 该工具能够并排显示两个二进制文件,以便相似的位置在两侧都位于...
    • geo:Rust的地理空间基元和算法
      geo:Rust的地理空间基元和算法
    • freeverb-rs:Freeverb算法Rust实现
      Freeverb算法Rust实现。 关于自由词 Freeverb最初由“ Jezar at Dreampoint”用C ++编写,并于2000年6月发布到公共领域。现在,它已在多种软件的各种版本中广泛使用。 关于freeverb-rs Rust中Freeverb的这种实现...
    • spiril:用于遗传算法Rust
      Spiril是遗传算法的一种实现,该遗传算法用于通过突变和自然选择来获得任务的最佳变量(遗传)。 API使您可以指定一组初始单元,这些单元将充当所有后续单元的原始父级。 单位类型实现适应度函数和繁殖函数,以将新...
    • redcentipede:Rust 中的遗传算法项目
      Rust 中的遗传算法项目 该项目的概念大量借鉴了。 红蜈蚣的一般博弈论 那里存在: 世界 部分代理 一些资源 时间单位 世界- 世界是一个具有 X、Y 坐标的二维网格。 存在的代理和资源都有一个 X 和一个 Y,它们指的是...
    • metaheuristics-rs:Rust中元算法的实现
      元启发式 Rust中元算法的实现。
    • isosurface:等值面提取的Rust算法
      Rust中实现的等值面提取算法。 包括经典的行进立方体和双重轮廓技术,以及主题上的更多现代变化。 为了教育的目的,每种提取算法的文档都链接到相关的学术论文。 范例程序 cargo run --example sampler将执行采样...
    • SIM800C_MQTT.rar
      使用SIM800C模块,使用MQTT协议,连接中国移动onenet平台,能实现数据的订阅、发布、存储等