基于Qt和C++的排序算法实现，优秀数据结构程序设计，新手必看！

#include "Sort.h" #include <cassert> using namespace Sort; template<class T> inline bool AbstractSort<T>::compare(uint index1, uint index2){ // we assert index2 is bigger than index1 // exp: return false if index1>index2 and sort is ascend. assert(index1 < length && index2 < length); assert(index2 > index1); this->compare_times++; if(this->is_ascend) return (this->src_list[index2] >= this->src_list[index1]); else return (this->src_list[index2] <= this->src_list[index1]); } template<class T> inline void AbstractSort<T>::swap(uint index1, uint index2){ assert(index1 < length && index2 < length); this->swap_times++; auto tmp = this->src_list[index1]; this->src_list[index1] = this->src_list[index2]; this->src_list[index2] = tmp; } template<class T> inline void AbstractSort<T>::assign(uint start, uint len, T* data) { assert(start + len <= this->length); this->assign_times += len; for(uint i = 0; i < len; ++i) this->src_list[start + i] = data[i]; } template<class T> std::ostream& AbstractSort<T>::display(std::ostream& out)const{ for(uint i = 0; i < this->length; ++i) out << this->src_list[i] << " "; return out << std::endl; } template<class T> std::ostream& AbstractSort<T>::detail(std::ostream& out)const{ out << "Swap and compare times of this sort method are show below:" << std::endl; out << "- The swap times: " << this->swap_times << std::endl; out << "- The compare times: " << this->compare_times << std::endl; out << "- The directly assign times: " << this->assign_times << std::endl; return out; }