<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[updowndown的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/updowndown</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; updowndown]]></copyright><item><title><![CDATA[Eclipse+NDK+adt+cdt开发环境问题解决]]></title><link>https://blog.youkuaiyun.com/updowndown/article/details/48712657</link><guid>https://blog.youkuaiyun.com/updowndown/article/details/48712657</guid><author>updowndown</author><pubDate>Thu, 24 Sep 2015 16:09:49 +0800</pubDate><description><![CDATA[概述

本文描述了在Eclipse环境下进行NDK开发时遇到的问题及相关解决方法。 
问题列表： 
* Unresolved inclusion: <jni.h>或Unresolved inclusion: <vector>等 
* memcpy的Invalid arguments问题

这几个问题不影响程序的编译，但会导致无法在Eclipse中进行运行程序等操作。]]></description><category></category></item><item><title><![CDATA[Android.mk文件说明]]></title><link>https://blog.youkuaiyun.com/updowndown/article/details/48523459</link><guid>https://blog.youkuaiyun.com/updowndown/article/details/48523459</guid><author>updowndown</author><pubDate>Thu, 17 Sep 2015 16:23:11 +0800</pubDate><description><![CDATA[Android.mk使用说明]]></description><category></category></item><item><title><![CDATA[编程珠玑——排序算法]]></title><link>https://blog.youkuaiyun.com/updowndown/article/details/6289827</link><guid>https://blog.youkuaiyun.com/updowndown/article/details/6289827</guid><author>updowndown</author><pubDate>Wed, 30 Mar 2011 20:14:00 +0800</pubDate><description><![CDATA[编程珠玑第11章讲解的几种排序算法的C++实现  #include "stdafx.h"
#include 
#include 
#include 
#include "windows.h"
using namespace std;

template
inline void isort( InPos posBegin_, InPos posEnd_ )
{
	/// 通过_Val_type函数获取到迭代器指向的数据类型
	_isort(posBegin_, posEnd_, _Val]]></description><category></category></item><item><title><![CDATA[求向量的最大子向量和]]></title><link>https://blog.youkuaiyun.com/updowndown/article/details/6287009</link><guid>https://blog.youkuaiyun.com/updowndown/article/details/6287009</guid><author>updowndown</author><pubDate>Tue, 29 Mar 2011 19:38:00 +0800</pubDate><description><![CDATA[编程珠玑第8章求子向量和算法的C++实现  
#include "stdafx.h"
#include 
#include 
#include 
#include 
#include "windows.h"
using namespace std;

/// O(n^3)算法
template
bool MaxSubVectorSum1( InPt posBegin_, InPt posEnd_, ValueType& MaxSubSum_ )
{
	if( posBegin_ =]]></description><category></category></item><item><title><![CDATA[查找顺序数组中元素第一次出现的位置（二分查找）]]></title><link>https://blog.youkuaiyun.com/updowndown/article/details/6285132</link><guid>https://blog.youkuaiyun.com/updowndown/article/details/6285132</guid><author>updowndown</author><pubDate>Tue, 29 Mar 2011 08:44:00 +0800</pubDate><description><![CDATA[编程珠玑第4章第2题  
#include "stdafx.h"
#include 
#include 
using namespace std;

template
bool IsSorted( InPtr posBegin_, InPtr posEnd_ )
{
	InPtr posSecond = posBegin_;
	++posSecond;
	for( ;posSecond != posEnd_; ++posSecond)
	{
		if( *posSecond 
I]]></description><category></category></item></channel></rss>