add a series of sorting functions

Author: psiphony

Vector/Vector/Vector.h

@@ -11,6 +11,7 @@ class Vector
 		elem_ = new T[capacity_ = c];
 		for (size_ = 0; size_ < s; elem_[size_++] = e);
 	}
+
 	Vector(T* array, int lo, int hi) { copyFrom(array, lo, hi); }
 	Vector(T* array, int n) { copyFrom(array, 0, n); }
 	Vector(Vector<T> const& v) { copyFrom(v.elem_, 0, v.size_); }
@@ -30,10 +31,15 @@ class Vector
 	T append(T const& e);//insert an element in the last
 	int removeFrom(int lo, int hi);//remove elements in range of [lo,hi)
 	T remove(int loc);
+	/*sort*/
 	void mergeSort(int lo, int hi);
 	void merge(int lo, int mi, int hi);
 	void sort() { mergeSort(0, size_); }
-
+	void heapSort(int lo, int hi);
+	void quickSort(int lo, int hi);
+	int partition(int lo, int hi);
+	void shellSort(int lo, int hi);
+	void shellInsert(int lo, int hi, int step);
 protected:
 	T* elem_;
 	int capacity_;

Vector/Vector/Vector.vcxproj

@@ -113,6 +113,7 @@
   <ItemGroup>
     <ClInclude Include="Vector.h" />
     <ClInclude Include="vector_implement.h" />
+    <ClInclude Include="vector_implement_sort.h" />
   </ItemGroup>
   <ItemGroup>
     <ClCompile Include="main.cpp" />

Vector/Vector/Vector.vcxproj.filters

@@ -21,6 +21,9 @@
     <ClInclude Include="vector_implement.h">
       <Filter>头文件</Filter>
     </ClInclude>
+    <ClInclude Include="vector_implement_sort.h">
+      <Filter>头文件</Filter>
+    </ClInclude>
   </ItemGroup>
   <ItemGroup>
     <ClCompile Include="main.cpp">

Vector/Vector/main.cpp

@@ -3,16 +3,11 @@
 
 int main(int argc, char* argv[])
 {
-	int a[] = {1,2,3,4,5,6,7,8};
-	Vector<int> v(a, 8);
-	v.sort();
-	for (int i = 0; i < v.size(); ++i)
-	{
-		std::cout << v[i] << ' ';
-	}
-	std::cout << v.search(5);
-	v.insert(4, 4);
-	std::cout << v.search(5);
-	v.remove(4);
-	std::cout << v.search(5);
+	int a[] = { 4,4,5,7,8,0,2,2,4,76,4,87,1 };
+	Vector<int> v(a, sizeof(a) / sizeof(int));
+	v.shellSort(0,v.size());
+//	for (int i = 0; i < v.size(); ++i)
+//	{
+//		std::cout << v[i] << ' ';
+//	}
 }

Vector/Vector/vector_implement.h

@@ -70,29 +70,4 @@ int Vector<T>::search(T const& e,int lo,int hi) const
 	}
 	return --lo;
 }
-template <typename T>
-void Vector<T>::mergeSort(int lo, int hi)
-{
-	if (hi - lo < 2) return;
-	int mi = (lo + hi) >> 1;
-	mergeSort(lo, mi);
-	mergeSort(mi, hi);
-	merge(lo, mi, hi);
-}
-template <typename T>
-void Vector<T>::merge(int lo, int mi, int hi)
-{
-	T* former = new T[mi - lo];
-	for (int i = 0,j=lo; j < mi; ++i,++j)
-	{
-		former[i] = elem_[j];
-	}
-	for (int i = 0, j = mi, k = lo; i < mi - lo || j < hi;)
-	{
-		if ((i < mi - lo) && ((!(j < hi) || former[i] <= elem_[j])))
-			elem_[k++] = former[i++];
-		if ((j < hi) && (!(i < mi - lo) || former[i] > elem_[j]))
-			elem_[k++] = elem_[j++];
-	}
-	delete[]former;
-}
+#include"vector_implement_sort.h"

Vector/Vector/vector_implement_sort.h

@@ -0,0 +1,111 @@
+#pragma once
+#include <ostream>
+#include <iostream>
+
+template <typename T>
+void Vector<T>::mergeSort(int lo, int hi)
+{
+	if (hi - lo < 2) return;
+	int mi = (lo + hi) >> 1;
+	mergeSort(lo, mi);
+	mergeSort(mi, hi);
+	merge(lo, mi, hi);
+}
+
+template <typename T>
+void Vector<T>::merge(int lo, int mi, int hi)
+{
+	T* former = new T[mi - lo];
+	for (int i = 0, j = lo; j < mi; ++i, ++j)
+	{
+		former[i] = elem_[j];
+	}
+	for (int i = 0, j = mi, k = lo; i < mi - lo || j < hi;)
+	{
+		if ((i < mi - lo) && ((!(j < hi) || former[i] <= elem_[j])))
+			elem_[k++] = former[i++];
+		if ((j < hi) && (!(i < mi - lo) || former[i] > elem_[j]))
+			elem_[k++] = elem_[j++];
+	}
+	delete[]former;
+}
+
+#include "D:\OneDrive\OneDrive - stu.ncwu.edu.cn\PQ_ComplHeap\PQ_ComplHeap\PQ_ComplHeap/PQ_ComplHeap.h"
+
+template <typename T>
+void Vector<T>::heapSort(int lo, int hi)
+{
+	PQ_ComplHeap<T> pq(elem_, hi - lo);
+	for (int i = hi - 1; i >= lo; --i)
+	{
+		elem_[i] = pq.delMax();
+	}
+}
+
+template <typename T>
+void Vector<T>::quickSort(int lo, int hi)
+{
+	if (hi - lo < 2)
+		return;
+	int mi = partition(lo, hi - 1);
+	quickSort(lo, mi);
+	quickSort(mi + 1, hi);
+}
+
+template <typename T>
+int Vector<T>::partition(int lo, int hi)
+{
+	std::swap(elem_[lo], elem_[lo + rand() % (hi - lo + 1)]);
+	T pivot = elem_[lo];
+	while (lo < hi)
+	{
+		while ((lo < hi) && (pivot <= elem_[hi]))
+			--hi;
+		elem_[lo] = elem_[hi];
+		while ((lo < hi) && (elem_[lo] <= pivot))
+			++lo;
+		elem_[hi] = elem_[lo];
+	}
+	elem_[lo] = pivot;
+	return lo;
+}
+
+template <typename T>
+void Vector<T>::shellSort(int lo, int hi)
+{
+	int a[] = {1,3,7,15,31,64};
+	Vector<int> step(a, sizeof(a) / sizeof(int));
+	for (int i = step.search(hi - lo); i >= 0; --i)
+	{
+		shellInsert(lo, hi, step[i]);
+		for (int i = 0; i < this->size(); ++i)
+		{
+			std::cout << elem_[i] << ' ';
+		}
+		std::cout << std::endl;
+	}
+}
+
+template <typename T>
+void Vector<T>::shellInsert(int lo, int hi, int step)
+{
+	for (int col = 0; col < step; ++col)
+	{
+		int cur_elem;
+		for (cur_elem = lo + step + col; cur_elem < hi; cur_elem += step)
+		{
+			int loc_to_insert;
+			T temp = elem_[cur_elem];
+			for (loc_to_insert = cur_elem - step; loc_to_insert >= lo; loc_to_insert -= step)
+			{
+				if (elem_[loc_to_insert] < elem_[cur_elem])
+					break;
+			}
+			for (int move_index = cur_elem - step; move_index > loc_to_insert; move_index -= step)
+			{
+				elem_[move_index + step] = elem_[move_index];
+			}
+			elem_[loc_to_insert + step] = temp;
+		}
+	}
+}