DS_ALGO：数据结构和算法-源码
DS_ALGO
数据结构和算法数据结构：
数组
堆栈
s列
链表
哈希表
树木
图表
排序算法
气泡排序
选择排序
插入排序
合并排序
快速排序
桶分类
计数排序
堆排序
基数排序
搜索算法
线性搜寻
二元搜寻
插值搜索
数组中的第二个Max
在矩阵上进行二进制搜索
数数X的数组
如果阵列顺时针旋转，则查找最小值
反转对
找出a，b使a + b = X
合并后找到两个排序数组的中位数
图算法
图表示
广度优先搜索
深度优先搜索
拓扑排序
未加权图的最小路径
有向无环图的最短路径
Dijkstra的算法
Floyd Warshall算法
递归
河内塔
N皇后问题
老鼠迷宫问题
m着色问题
特殊算法
Karp Rabin算法
唐津乘法
贪婪算法
小背包
霍夫曼码
动态编程
切杆
编辑距离
自动换行
0-1背包
最低硬币
子集总和问题
最低成本路径
近似问题
最小顶点覆盖
文件下载
资源详情
[{"title":"（ 87 个子文件 178KB ） DS_ALGO：数据结构和算法-源码","children":[{"title":"DS_ALGO-master","children":[{"title":"Greedy","children":[{"title":"Fractional_Knpsack.Py <span style='color:#111;'> 742B </span>","children":null,"spread":false},{"title":"Huffman_Codes.Py <span style='color:#111;'> 1.19KB </span>","children":null,"spread":false}],"spread":true},{"title":"Karastuba_Multiplication","children":[{"title":"Karastuba_Multiplication.Py <span style='color:#111;'> 696B </span>","children":null,"spread":false}],"spread":true},{"title":"Karp Rabin Algorithm","children":[{"title":"Karp Rabin Aldorithm.Py <span style='color:#111;'> 1.09KB </span>","children":null,"spread":false}],"spread":true},{"title":"Stacks","children":[{"title":"Stack_LinkedList.C <span style='color:#111;'> 840B </span>","children":null,"spread":false},{"title":"twostacks.c <span style='color:#111;'> 1.58KB </span>","children":null,"spread":false},{"title":"eval_post.c <span style='color:#111;'> 579B </span>","children":null,"spread":false},{"title":"Infix_to_Postfix.C <span style='color:#111;'> 960B </span>","children":null,"spread":false}],"spread":true},{"title":"Approximation","children":[{"title":"Minimum Vertex Cover.Py <span style='color:#111;'> 792B </span>","children":null,"spread":false}],"spread":true},{"title":"Linked%20List","children":[{"title":"doublell.c <span style='color:#111;'> 1.14KB </span>","children":null,"spread":false},{"title":"mul_poly.c <span style='color:#111;'> 2.30KB </span>","children":null,"spread":false},{"title":"add_poly.c <span style='color:#111;'> 2.31KB </span>","children":null,"spread":false},{"title":"Circular_LinkedList <span style='color:#111;'> 1.87KB </span>","children":null,"spread":false}],"spread":true},{"title":"Divide N Conquer","children":[{"title":"BinarySearch_on_Matrix.c <span style='color:#111;'> 498B </span>","children":null,"spread":false},{"title":"CountX.c <span style='color:#111;'> 815B </span>","children":null,"spread":false},{"title":"FindMin_in_ClockwiseRotation.c <span style='color:#111;'> 971B </span>","children":null,"spread":false},{"title":"Two_no_Sum_X.c <span style='color:#111;'> 377B </span>","children":null,"spread":false},{"title":"second_max.c <span style='color:#111;'> 1.17KB </span>","children":null,"spread":false},{"title":"InvPairs.c <span style='color:#111;'> 996B </span>","children":null,"spread":false},{"title":"median_two_sorted_array.c <span style='color:#111;'> 782B </span>","children":null,"spread":false}],"spread":true},{"title":"Sorting","children":[{"title":"BucketSort.C <span style='color:#111;'> 914B </span>","children":null,"spread":false},{"title":"se_sort.c <span style='color:#111;'> 469B </span>","children":null,"spread":false},{"title":"Insertion_sort.c <span style='color:#111;'> 426B </span>","children":null,"spread":false},{"title":"HeapSort.C <span style='color:#111;'> 881B </span>","children":null,"spread":false},{"title":"RadixSort.C <span style='color:#111;'> 1.00KB </span>","children":null,"spread":false},{"title":"CountingSort.C <span style='color:#111;'> 757B </span>","children":null,"spread":false},{"title":"MergeSort.C <span style='color:#111;'> 1014B </span>","children":null,"spread":false},{"title":"QuickSort.C <span style='color:#111;'> 709B </span>","children":null,"spread":false},{"title":"Bubble_Sort.C <span style='color:#111;'> 362B </span>","children":null,"spread":false}],"spread":true},{"title":"Linked List","children":[{"title":"ll_try1.exe <span style='color:#111;'> 131.11KB </span>","children":null,"spread":false},{"title":"ll_try1.c <span style='color:#111;'> 2.86KB </span>","children":null,"spread":false},{"title":"new add <span style='color:#111;'> 1.63KB </span>","children":null,"spread":false},{"title":"linked_llist.c <span style='color:#111;'> 2.03KB </span>","children":null,"spread":false},{"title":"bubblell2.c <span style='color:#111;'> 1.56KB </span>","children":null,"spread":false},{"title":"linked_list.exe <span style='color:#111;'> 128.82KB </span>","children":null,"spread":false},{"title":"selectionll.c <span style='color:#111;'> 1.42KB </span>","children":null,"spread":false},{"title":"linked_list.c <span style='color:#111;'> 2.86KB </span>","children":null,"spread":false},{"title":"sahil_cl.c <span style='color:#111;'> 877B </span>","children":null,"spread":false},{"title":"josephus.c <span style='color:#111;'> 852B </span>","children":null,"spread":false},{"title":"bubblell.c <span style='color:#111;'> 1.37KB </span>","children":null,"spread":false},{"title":"linked_llist.exe <span style='color:#111;'> 128.82KB </span>","children":null,"spread":false},{"title":"linked_list.cpp <span style='color:#111;'> 2.03KB </span>","children":null,"spread":false}],"spread":false},{"title":"Dynamic Programming","children":[{"title":"Min_Cost_Path.C <span style='color:#111;'> 814B </span>","children":null,"spread":false},{"title":"Min Coins.C <span style='color:#111;'> 1.00KB </span>","children":null,"spread":false},{"title":"Subset Sum Probem.C <span style='color:#111;'> 1.29KB </span>","children":null,"spread":false},{"title":"DP_Word_Wrap.py <span style='color:#111;'> 919B </span>","children":null,"spread":false},{"title":"DP_Edit_Distance.py <span style='color:#111;'> 574B </span>","children":null,"spread":false},{"title":"Kadane'sAlgo.c <span style='color:#111;'> 560B </span>","children":null,"spread":false},{"title":"DP_Knapsack.py <span style='color:#111;'> 788B </span>","children":null,"spread":false},{"title":"DP_Cut_Rod.py <span style='color:#111;'> 528B </span>","children":null,"spread":false}],"spread":true},{"title":"Trees","children":[{"title":"Tree_PreOrder_NonRec.C <span style='color:#111;'> 1.12KB </span>","children":null,"spread":false},{"title":"preorder_nonrec.py <span style='color:#111;'> 842B </span>","children":null,"spread":false},{"title":"tree_inorder_nonrecursion <span style='color:#111;'> 602B </span>","children":null,"spread":false},{"title":"tree_postorder.c <span style='color:#111;'> 633B </span>","children":null,"spread":false},{"title":"tree_inorder.c <span style='color:#111;'> 602B </span>","children":null,"spread":false},{"title":"tree_preorder.c <span style='color:#111;'> 627B </span>","children":null,"spread":false},{"title":"Binary_search_tree.c <span style='color:#111;'> 3.71KB </span>","children":null,"spread":false}],"spread":true},{"title":"Codechef","children":[{"title":"COOK92B","children":[{"title":"CO92JUDG.py <span style='color:#111;'> 303B </span>","children":null,"spread":false},{"title":"CO92MATR.py <span style='color:#111;'> 793B </span>","children":null,"spread":false},{"title":"CO92SUBW.py <span style='color:#111;'> 295B </span>","children":null,"spread":false}],"spread":true},{"title":"MARCH18B","children":[{"title":"CHEGLOVE.py <span style='color:#111;'> 475B </span>","children":null,"spread":false},{"title":"MINEAT.py <span style='color:#111;'> 677B </span>","children":null,"spread":false},{"title":"BIGSALE.py <span style='color:#111;'> 200B </span>","children":null,"spread":false},{"title":"MIXCOLOR.py <span style='color:#111;'> 246B </span>","children":null,"spread":false},{"title":"PSHTRG (partial).py <span style='color:#111;'> 564B </span>","children":null,"spread":false},{"title":"MINVOTE.py <span style='color:#111;'> 607B </span>","children":null,"spread":false},{"title":"XXOR.py <span style='color:#111;'> 771B </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"Searching","children":[{"title":"binary_search.c <span style='color:#111;'> 468B </span>","children":null,"spread":false},{"title":"Interpolation_Search.C <span style='color:#111;'> 820B </span>","children":null,"spread":false}],"spread":true},{"title":"Extras","children":[{"title":"Multiplication_Matrix.C <span style='color:#111;'> 896B </span>","children":null,"spread":false},{"title":"armstrong.c <span style='color:#111;'> 291B </span>","children":null,"spread":false}],"spread":true},{"title":"Queue","children":[{"title":"Q_ins_k.c <span style='color:#111;'> 943B </span>","children":null,"spread":false}],"spread":false},{"title":"README.md <span style='color:#111;'> 1.79KB </span>","children":null,"spread":false},{"title":"Graph","children":[{"title":"DFS.Py <span style='color:#111;'> 1013B </span>","children":null,"spread":false},{"title":"Dijkstra.Py <span style='color:#111;'> 1.79KB </span>","children":null,"spread":false},{"title":"Floyd-Warshall-Algorithm.py <span style='color:#111;'> 1.71KB </span>","children":null,"spread":false},{"title":"Minimum Path.Py <span style='color:#111;'> 1.74KB </span>","children":null,"spread":false},{"title":"Topological Sort.Py <span style='color:#111;'> 859B </span>","children":null,"spread":false},{"title":"GraphRepresentation.C <span style='color:#111;'> 1.49KB </span>","children":null,"spread":false},{"title":"BFS.Py <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false},{"title":"Shotest Path DAG.Py <span style='color:#111;'> 2.24KB </span>","children":null,"spread":false}],"spread":false},{"title":"Recurssion & Backtracking","children":[{"title":"Rat_Maze_Recurssion_Backtracking.c <span style='color:#111;'> 889B </span>","children":null,"spread":false},{"title":"Tower_Of_Hanoi.C <span style='color:#111;'> 343B </span>","children":null,"spread":false},{"title":"Nqueen-1D.py <span style='color:#111;'> 1.42KB </span>","children":null,"spread":false},{"title":"m-coloring-problem.py <span style='color:#111;'> 1.09KB </span>","children":null,"spread":false},{"title":"NQueen-1D-AllSolution.Py <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"N_Queen_recursion_backtracking.c <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":true}]
评论信息
其他资源
- QT 开启线程接收串口数据并由主线程界面实时显示心电波形图
- plist\atlas合图拆分工具.jar jdk1.8 带源码 可执行jar文件
- 默纳克监控软件
- 超声波发射电路设计电路图
- 数据库课程设计（java实现）饭卡管理系统
- 基于socket的聊天程序+课程设计报告(包括登录，注册，显示在线人数，JAVA)
- 城市公交管理系统(毕业设计必备，你懂的)
- zipalign.exe 下载
- Reinforcement Learning-An Introduction by Sutton R S，Barto A G
- Oracle练习的三个表emp，dept，salgrade
- android 通过WampServer集成环境通过php+mysql实现注册登录功能
- Teaching Player
- 投票React-源码
- blog.minchin.ca：位于blog.minchin.ca的鹈鹕博客的来源-源码
- T1200 USER MANUAL.pdf
- erdas imagine 2015_imagine后能加todo吗
- WinIoLib库
- C# 机器码生成License
- unity3d 双面贴图
- java编写的智能五子棋
- 面向对象软件工程-第三版（英文版）
- jsp servlet宠物系统
- 基于安卓手机的短信加密
- 哈工程自动化复试微机原理课件
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明