首页 开发技术 其它     /    DS_ALGO:数据结构和算法-源码

DS_ALGO:数据结构和算法-源码

上传者: weixin_42160425 | 上传时间:2024/7/8 3:57:22 | 文件大小:178KB | 文件类型:ZIP
DS_ALGO:数据结构和算法-源码
DS_ALGO数据结构和算法数据结构:数组堆栈s列链表哈希表树木图表排序算法气泡排序选择排序插入排序合并排序快速排序桶分类计数排序堆排序基数排序搜索算法线性搜寻二元搜寻插值搜索数组中的第二个Max在矩阵上进行二进制搜索数数X的数组如果阵列顺时针旋转,则查找最小值反转对找出a,b使a+b=X合并后找到两个排序数组的中位数图算法图表示广度优先搜索深度优先搜索拓扑排序未加权图的最小路径有向无环图的最短路径Dijkstra的算法FloydWarshall算法递归河内塔N皇后问题老鼠迷宫问题m着色问题特殊算法KarpRabin算法唐津乘法贪婪算法小背包霍夫曼码动态编程切杆编辑距离自动换行0-1背包最低硬币子集总和问题最低成本路径近似问题最小顶点覆盖 本软件ID:14988572

文件下载

资源详情

[{"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":"KarpRabinAlgorithm","children":[{"title":"KarpRabinAldorithm.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":"MinimumVertexCover.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":"DivideNConquer","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":"LinkedList","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":"newadd <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":"DynamicProgramming","children":[{"title":"Min_Cost_Path.C <span style='color:#111;'>814B</span>","children":null,"spread":false},{"title":"MinCoins.C <span style='color:#111;'>1.00KB</span>","children":null,"spread":false},{"title":"SubsetSumProbem.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":"MinimumPath.Py <span style='color:#111;'>1.74KB</span>","children":null,"spread":false},{"title":"TopologicalSort.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":"ShotestPathDAG.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}]

评论信息

免责申明

【好快吧下载】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【好快吧下载】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【好快吧下载】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,8686821#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明