算法
文章平均质量分 54
NoviceSi
这个作者很懒,什么都没留下…
展开
-
Sorting Algorithms Part1
1.Bubble Sortvoid BubbleSort(int list[],int total){ int temp; for(int i=total-1;i>0;i--){ for(int j=total-1;j>total-1-i;j--){ if(list[j]list[j-1]){ temp原创 2016-11-16 00:13:09 · 343 阅读 · 0 评论 -
Linked Lists Part1-Singly Linked Lists
1. Definition of a nodestruct Node{ int data; Node *next;};Node* head;2. Create a linked listvoid Create(Node* head,int n){ Node *p,*q; q=head; for(int i=0;i<n;i++){ p=new原创 2017-01-08 11:34:52 · 238 阅读 · 0 评论 -
Recursion
Basic idea of recursion原创 2017-02-18 14:18:49 · 314 阅读 · 0 评论 -
Backtracking
1. Introduction Backtracking is a method of exhaustive search. When a node reaches certain termination condition that means this path will not have solutions, the program will go back to the previous原创 2017-02-18 16:49:32 · 368 阅读 · 0 评论 -
Greedy Algorithm (To be updated)
1. Knapsack Problem (Allows partial storage)#include #include using namespace std;const int n=4;int cont=100;double tvalue=0;struct item{ int weight; int value; double ValperWei;原创 2017-03-15 00:26:17 · 306 阅读 · 0 评论