Merge branch 'master' of https://github.com/wyh267/algorithms into wyh267-master

Conflicts:	Makefile

Author: xtaci

Makefile

@@ -63,7 +63,9 @@ PROGRAMS = m_based_demo \
 btree_demo \
 sort_demo \
 fib-heap_demo \
-scc_demo
+scc_demo \
+sort_demo \
+bubble_sort_demo
 
 all: $(PROGRAMS)
 

include/bubble_sort.h

@@ -0,0 +1,51 @@
+
+
+
+#ifndef _bubble_sort_h_
+#define _bubble_sort_h_
+
+
+#include <iostream>
+#include <stdio.h>
+#include <stdlib.h> 
+#include <time.h>
+
+
+using namespace std;
+
+namespace aglo{
+
+template<typename T>
+static voidBubbleSort(T list[],int start,int end){
+
+
+T tmp;
+if(start < end){
+for(size_t i = start; i <= end; ++i)
+{
+for(size_t j = i+1; j <= end; ++j)
+{
+if(list[i]>=list[j]){
+
+tmp=list[i];
+list[i]=list[j];
+list[j]=tmp;
+
+}
+
+}
+
+}
+
+}
+
+}
+
+
+
+
+
+}
+
+
+#endif

src/bubble_sort_demo.cpp

@@ -0,0 +1,29 @@
+#include <stdio.h>
+#include <stdlib.h> 
+#include <time.h>
+
+#include "generic.h"
+#include "bubble_sort.h"
+
+
+
+using namespace alg;
+int main (int argc, char const *argv[])
+{
+const int MAX_ELEMENTS = 10;
+int list[MAX_ELEMENTS];
+for(int i = 0; i < MAX_ELEMENTS; i++ ){
+list[i] = rand()%100;
+}
+printf("The list before sorting is:\n");
+printlist(list,MAX_ELEMENTS);
+
+// sort the list using quicksort
+aglo::BubbleSort(list,0,MAX_ELEMENTS-1);
+
+// print the result
+printf("The list after sorting using quicksort algorithm:\n");
+printlist(list,MAX_ELEMENTS);
+
+return 0;
+}