stdafx.h

OptimizedQuickSort 理论上快速排序的平均时间复杂度是nlgn.最差是n^2. 但实际实现中可能表现的不如插入排序等其他算法。

// stdafx.h : include file for standard system include files,
//  or project specific include files that are used frequently, but
//      are changed infrequently
//

#if !defined(AFX_STDAFX_H__DEE8D97C_2BD1_4B55_97AB_1708CF2BA067__INCLUDED_)
#define AFX_STDAFX_H__DEE8D97C_2BD1_4B55_97AB_1708CF2BA067__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#define WIN32_LEAN_AND_MEAN		// Exclude rarely-used stuff from Windows headers

#include <stdio.h>

// TODO: reference additional headers your program requires here

//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.

#endif // !defined(AFX_STDAFX_H__DEE8D97C_2BD1_4B55_97AB_1708CF2BA067__INCLUDED_)