6cdh's Blog

On Read/Write Code

Thu, 27 Jun 2024 15:19:28 +0800

Recently I’ve been thinking about how to improve reading and writing code. Here are some ideas for discussion.

Keep Healthy

Wed, 23 Aug 2023 10:13:18 +0800

Many young people have unhealthy routines and habits. This post will introduce a reason why we should have healthy routines and habits.

How to programming fast

Tue, 08 Aug 2023 21:17:05 +0800

I have a good understanding of algorithms, data structures, logic, program verification, and Vim keybindings. Why am I not fast as I thought?

Reopen my blog

Tue, 08 Aug 2023 11:13:01 +0800

I want to reopen my blog suddenly.

How new is implemented

Wed, 21 Apr 2021 23:41:50 +0800

You may be asked what’s the difference between new and malloc. In fact, they are completely different. However, in a sense, they are almost no difference.

How Compilers Initialize C style array

Tue, 13 Apr 2021 16:39:06 +0800

In C++11, you can initialize all members of a C-style array to zero.

The Behavior of Modulo operation

Tue, 16 Mar 2021 23:02:50 +0800

The modulo operator can be found in almost every programming language. However, the behavior of how they are defined depends on the language.

The Stack Sorting

Wed, 10 Mar 2021 12:32:42 +0800

Recently, I got stuck in the stack data structure. Everyone knows that the stack is a LIFO (Last In First Out) data structure. This is easy to understand, but not easy to use sometimes.

The Welfare Crook

Thu, 21 Jan 2021 20:52:12 +0000

题目 The Welfare Crook, 出自 “Science of Programming”:

Suppose we have three long magnetic tapes, each containing a list of names in alphabetical order. The first list contains the names of people woring at IBM Yorktown, the second the names of students at Columbia University and the third the names of people on welfare in New York City. Practically speaking, all three lists are endless, so no upper bounds are given. It is known that at least one person is on all three lists. Write a program to locate the first such person (the one with the alphabetically smallest person).

模板特化与实例化

Sat, 16 Jan 2021 10:42:26 +0000

模板特化和实例化有时挺让人迷惑.

使用元素间索引

Mon, 23 Nov 2020 22:30:00 +0000

使用索引还是迭代器? 从 0 开始还是从 1 开始? 左闭右开还是左开右闭? 亦或是全闭/全开区间? 索引产生的微小错误让人混乱? (这也叫差一错误 (off-by-one error)). 如果你曾为这些问题困扰, 那么元素间索引的思想或许可以帮助你.

标准库中的字符串搜索

Sat, 21 Nov 2020 00:00:00 +0000

给定文本 T(ext) 和模式 P(attern), 字符串搜索问题在 T 中寻找 P 出现的位置.

C++ 模板参数推导

Mon, 19 Oct 2020 22:14:18 +0000

实例化函数模板时, 模板实参必须是已知的, 但不必显式指定. 编译器会从函数模板的实参中推导缺失的模板实参. 另外模板参数推导也可以在 auto 说明符的上下文中从初始化器推导变量的类型.

C++ 中的 virtual 函数和 RTTI

Wed, 23 Sep 2020 02:52:13 +0000

C++ 中的 virtual 说明符指定非静态成员函数为虚函数, 并支持基类和派生类的运行时调用. 只要在基类和派生类中重载虚函数, 当使用基类的引用或指针指向派生类的对象时, 对该指针或引用调用虚函数依然可以调用派生类的虚函数, 判断要调用哪个虚函数是在运行时实现的. RTTI (Run-Time Type Information) 是一种机制, 允许在运行时判断对象的类型信息. 同样是运行时, 两者的实现实际上是相似的. 这很有趣, 本文会深入一下它们的原理.

二分搜索及其变种

Wed, 23 Sep 2020 02:52:13 +0000

二分搜索 (binary search) 也称折半搜索 (half-interval search), 用于在有序数组上搜索给定值的位置. 这是一个常见的搜索算法, 似乎没什么难度. 然而, 在解决 Leetcode 35 (Search Insert Position) 时, 我意识到对二分搜索及其变种的理解还不够, 因此记录一下.