NoviceSi-CSDN博客

原创 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 304

原创 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 367

原创 Recursion

Basic idea of recursion

2017-02-18 14:18:49 312

原创 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

原创 Sorting Algorithms Part1

1.Bubble Sort void 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 335

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人