a brief look at c++. 7z
ABSTRACT ++ ++ This note describes some key aspects of what C is and of how C has developed ++ ++ over the years. The perspective is that of an experienced C user looking at C as a ++ practical tool. No attempts are made to compare C to other languages, though I have tried to answer some questions that I have often heard asked by Lisp programmers. 1 Introduction ++ ++ Like all living languages, C has grown and changed over the years. For me, the improvements to C ++ have seemed almost glacially slow and inevitable; they are natural developments of C !ˉs own interna logic and deliberate responses to the experiences of hundred of thousands of users. To many who wanted ++ ++ to use C aggressively, this growth has been frustratingly slow and timid. To some who considered C only infrequently, the developments have seem like unpredictable lurches into the unknown. To others, ++ C has simply been something peripheral about which little concrete was known, but about which a multi- tude of strange rumors persisted. ++ However you look at it, C has developed significantly since its first appearance. As an example, con- sider a simple function that sorts a container and then counts the number of entries between Dahl and Nygaard: template<class C> int cnt(C& v) { sort(c.begin(),v.end()); C::iterator d = find(v.begin(), v.end(), "Dahl"); return count(d, find(d, v.end(), "Nygaard")); }
- 1
- 粉丝: 1
- 资源: 4
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- Screenshot_20240427_031602.jpg
- 网页PDF_2024年04月26日 23-46-14_QQ浏览器网页保存_QQ浏览器转格式(6).docx
- 直接插入排序,冒泡排序,直接选择排序.zip
- 在排序2的基础上,再次对快排进行优化,其次增加快排非递归,归并排序,归并排序非递归版.zip
- 实现了7种排序算法.三种复杂度排序.三种nlogn复杂度排序(堆排序,归并排序,快速排序)一种线性复杂度的排序.zip
- 冒泡排序 直接选择排序 直接插入排序 随机快速排序 归并排序 堆排序.zip
- 课设-内部排序算法比较 包括冒泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、归并排序和堆排序.zip
- Python排序算法.zip
- C语言实现直接插入排序、希尔排序、选择排序、冒泡排序、堆排序、快速排序、归并排序、计数排序,并带图详解.zip
- 常用工具集参考用于图像等数据处理
评论0