- 博客(56)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 sort
// sort.cpp -- 2011-10-02-22.43#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::less ;templateclass Print{public: void operator () (co
2011-10-31 16:24:24
955
原创 set_union
// set_union.cpp -- 2011-10-05-06.53#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::greater ;templateclass Print{public: void operato
2011-10-31 16:23:54
2847
2
原创 set_symmetric_difference
// set_symmetric_difference.cpp -- 2011-10-05-14.24#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::greater ;templateclass Print{public:
2011-10-31 16:23:34
2663
原创 set_intersection
// set_intersection.cpp -- 2011-10-05-13.40#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::greater ;templateclass Print{public: void
2011-10-31 16:23:13
5458
原创 set_difference
// set_difference.cpp -- 2011-10-05-13.56#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::greater ;templateclass Print{public: void op
2011-10-31 16:22:49
1470
原创 search_n
// search_n.cpp -- 2011-10-01-23.52#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::equal_to ;int _tmain(int argc, _TCHAR* argv[]){ int ar
2011-10-28 09:47:41
719
原创 search
// search.cpp -- 2011-10-01-23.31#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::not_equal_to ;int _tmain(int argc, _TCHAR* argv[]){ int
2011-10-28 09:47:19
769
原创 rotate_copy
// rotate_copy.cpp -- 2011-10-03-23.30#include "stdafx.h"#include #include #include using std ::vector ;templateclass Print{public: void operator () (const T & t) const {
2011-10-28 09:46:50
896
原创 rotate
// rotate.cpp -- 2011-10-03-16.26#include "stdafx.h"#include #include #include #include using std ::vector ;templateclass Print{public: void operator () (const T & t) const
2011-10-28 09:46:28
759
原创 reverse_copy
// reverse_copy.cpp -- 2011-10-03-22.04#include "stdafx.h"#include #include #include using std ::vector ;templateclass Print{public: void operator () (const T & t) const {
2011-10-28 09:46:03
1360
原创 reverse
// reverse.cpp -- 2011-10-03-21.54#include "stdafx.h"#include #include #include using std ::vector ;templateclass Print{public: void operator () (const T & t) const { std
2011-10-27 09:59:17
705
原创 replace_if
// replace_if.cpp -- 2011-10-03-19.08#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::equal_to ;templateclass Print{public: void opera
2011-10-27 09:58:52
1649
原创 replace_copy
// replace_copy.cpp -- 2011-09-30-23.04#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::equal_to ;class Print{public: void operator () (
2011-10-27 09:58:26
1011
原创 replace
// replace.cpp -- 2011-10-03-18.40#include "stdafx.h"#include #include #include using std ::vector ;templateclass Print{public: void operator () (const T & t) const { std
2011-10-27 09:57:55
642
原创 remove_if
// remove_if.cpp -- 2011-10-03-16.00#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::equal_to ;templateclass Print{public: void operat
2011-10-27 09:56:01
825
原创 remove_copy_if
// remove_copy_if.cpp -- 2011-10-03-22.31#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::greater ;templateclass Print{public: void op
2011-10-23 14:13:52
2352
原创 remove_copy
// remove_copy.cpp -- 2011-10-03-22.16#include "stdafx.h"#include #include #include using std ::vector ;templateclass Print{public: void operator () (const T & t) const {
2011-10-23 14:13:30
820
原创 remove
// remove.cpp -- 2011-10-03-13.45#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::equal_to ;templateclass Print{public: void operator
2011-10-23 14:13:02
667
原创 random_shuffle
// random_shuffle.cpp -- 2011-10-03-23.53#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::pointer_to_unary_function ;templateclass Print{
2011-10-23 14:12:38
900
原创 prev_permutation
// prev_permutation.cpp -- 2011-10-05-06.23#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::less ;templateclass Print{public: void ope
2011-10-23 14:12:08
1533
原创 partition
// partition.cpp -- 2011-10-02-22.26#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::less ;int _tmain(int argc, _TCHAR* argv[]){ int arr1[
2011-10-23 00:05:09
759
原创 partial_sum
// partial_sum.cpp -- 2011-10-05-17.55#include "stdafx.h"#include #include #include #include #include using std ::vector ;using std ::plus ;templateclass Print{public: vo
2011-10-23 00:04:42
2376
原创 partial_sort_copy
// partial_sort_copy.cpp -- 2011-10-03-12.15#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::greater ;templateclass Print{public: void
2011-10-23 00:03:50
1686
原创 partial_sort
// partial_sort.cpp -- 2011-10-03-11.56#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::greater ;templateclass Print{public: void oper
2011-10-23 00:03:21
1229
原创 nth_element
// nth_element.cpp -- 2011-10-03-12.58#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::greater ;templateclass Print{public: void opera
2011-10-23 00:02:37
821
原创 next_permutation
// next_permutation.cpp -- 2011-10-04-21.58#include "stdafx.h"#include #include #include #include using std ::vector ;using
2011-10-16 19:15:41
521
原创 mismatch
// mismatch.cpp -- 2011-10-01-22.37#include "stdafx.h"#include #include #include #include #include using std ::vector ;usi
2011-10-16 19:14:58
658
原创 min_element
// min_element.cpp -- 2011-10-05-15.12#include "stdafx.h"#include #include #include #include using std ::vector ;using std :
2011-10-16 19:14:29
1419
原创 min
// min.cpp -- 2011-10-05-15.03#include "stdafx.h"#include #include #include using std ::min ;using std ::less ;int _tmain(
2011-10-16 19:13:56
576
原创 merge
// merge.cpp -- 2011-09-30-23.16#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::great
2011-10-16 19:13:14
601
原创 各种排序GP版
几种排序,用了很多STL函数.贴了.// sort.cpp// 2011-10-09-21.41 -- 2011-10-09-21.55 -- insertionSort.// 2011-10-13-06.25 -- 2011-10-13-06.46 -- bubbl
2011-10-16 19:12:18
1376
4
原创 max_element
// max_element.cpp -- 2011-10-05-15.21#include "stdafx.h"#include #include #include #include using std ::vector ;using std :
2011-10-13 17:45:16
3099
原创 max
// max.cpp -- 2011-10-05-15.09#include "stdafx.h"#include #include #include using std ::max ;using std ::less ;int _tmain(
2011-10-13 17:44:45
667
原创 lower_bound
// lower_bound.cpp -- 2011-10-01-00.21#include "stdafx.h"#include #include #include #include using std ::vector ;using std :
2011-10-13 17:44:18
912
原创 lexicographical_compare
// lexicographical_compare.cpp -- 2011-10-05-15.33#include "stdafx.h"#include #include #include #include using std ::vector ;
2011-10-13 17:43:50
1561
原创 iter_swap
// iter_swap.cpp -- 2011-10-03-18.19#include "stdafx.h"#include #include #include using std ::vector ;templateclass Print
2011-10-13 17:43:20
1001
原创 inplace_merge
// inplace_merge.cpp -- 2011-10-03-19.43#include "stdafx.h"#include #include #include #include using std ::vector ;using std
2011-10-09 18:41:38
1665
原创 inner_product
// inner_product.cpp -- 2011-10-05-17.07#include "stdafx.h"#include #include #include #include using std ::vector ;using std
2011-10-09 18:41:12
2222
原创 includes
// includes.cpp -- 2011-10-05-06.34#include "stdafx.h"#include #include #include #include using std ::vector ;using std ::gr
2011-10-09 18:40:47
922
原创 generate_n
// generate_n.cpp -- 2011-09-30-22.37#include "stdafx.h"#include #include #include using std ::vector ;templateclass Gen
2011-10-09 18:40:22
664
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人