﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-C++研究-随笔分类-ACM</title><link>http://www.cppblog.com/cxl82116/category/4673.html</link><description>Ｃ++细节深度探索及软件工程</description><language>zh-cn</language><lastBuildDate>Tue, 20 May 2008 13:47:07 GMT</lastBuildDate><pubDate>Tue, 20 May 2008 13:47:07 GMT</pubDate><ttl>60</ttl><item><title>求有序序列公共部分(集合交集的O(n)复杂度求法)</title><link>http://www.cppblog.com/cxl82116/archive/2008/01/15/41228.html</link><dc:creator>小龙哥</dc:creator><author>小龙哥</author><pubDate>Tue, 15 Jan 2008 13:12:00 GMT</pubDate><guid>http://www.cppblog.com/cxl82116/archive/2008/01/15/41228.html</guid><wfw:comment>http://www.cppblog.com/cxl82116/comments/41228.html</wfw:comment><comments>http://www.cppblog.com/cxl82116/archive/2008/01/15/41228.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/cxl82116/comments/commentRss/41228.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/cxl82116/services/trackbacks/41228.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 假定两个有序序列，扫描至多一遍求出其公共部分，复杂度O(n),但中间跳跃前进，实战复杂度在O(n)以下，应用环境为搜索引擎在对文档特征向量相似度的判定部分，对于10万维以上的数据，效率还可以~&nbsp;&nbsp;<a href='http://www.cppblog.com/cxl82116/archive/2008/01/15/41228.html'>阅读全文</a><img src ="http://www.cppblog.com/cxl82116/aggbug/41228.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/cxl82116/" target="_blank">小龙哥</a> 2008-01-15 21:12 <a href="http://www.cppblog.com/cxl82116/archive/2008/01/15/41228.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>