The following new C++11 features are covered in this edition:

• The long long int and unsigned long long types for declaring a signed and unsigned long integer of 64 bits are covered Chapter 2.
• Chapter 7 introduces traversing array elements using a foreach loop. The foreach loop can also be used to traverse elements in a container such as vector, list, and set. Chapter 7 also introduces converting numbers to strings using the to_string function.
• Chapter 9 introduces member initializers for initializing data fields in an object.
• The string class's back() and front() functions are introduced in Chapter 10.
• You can use the nullptr keyword to represent a null pointer in Chapter 11, which is better than using NULL or 0.
• Chapter 12 introduces vector initializers to simplify coding for initializing vectors. Smart pointer class unique_ptr is also introduced in this chapter for performing automatic object destruction.
• Chapter 13 shows that you can pass a file name as a string or C-String whichever is convenient.
• Chapter 15 introduces to use the override keyword to prevent errors for overriding functions and the final keyword to prevent a virtual function from being further overridden.
• Chapter 22 introduces the auto keyword for type inference. This is useful to simplify coding for variables of complex data types that can be automatically discovered by the compiler thorugh the context. The auto keyword should only be used for complex types, not simple types for improving the readability of the code. We introduce this new feature later in the book to avoid misusing or abusing it.
• Chapter 23 introduces lambda functions and new STL algorithms.
• Appendix H discusses regular expressions.

Additional new features:

• This edition provides many new examples and exercises to motivate and stimulate student interest in programming. (This is the hallmark for every new edition of the Liang book.)
• A new Chapter 24 on implementing hashing.
• A tutorial of Visual C++ 2015 is provided in the supplement.
• Extra exercises for instructors.
• New checkpoint questions.

• The introduction to computers and programming languages has been updated.

• Cover C++11 long long int and unsigned long long ints

• Add a new section on Common Errors and Pitfalls

• A new syntax for breaking a long string literal into multiple lines is introduced.

• The long section 5.2 is split into new Sections 5.2, 5.3, 5.4, and 5.5.
• Move the case study on approximating pi to supplement on the companion Website.

• Revise several diagrams.
• New examples using strings.

• Move AnalyzseNumbers example from Section 7.1 to Section 7.3 and move the Lotto example from Section 7.3 to the supplement.
• Use foreach loop to traverse elements in an array.
• To convert numbers to a string using the to_string function.

• New problem-driven introduction.

• Initialize data fields in the class declaration.

• New section on discovering class relationships.
• New string functions back() and front().
• New programming exercise 10.18.

• Revise the code in Section 11.15.

• The vector's insert and erase functions are introduced.
• Use the functions min_element, max_element, sort, random_shuffle for vectors.
• Initialize vector using C+11 vector initializers.
• Use smar pointer uniqeu_ptr for automatical memory destruction.

• Simplify coding using C++11 string argument for filename.
• Add new examples to demonstrate reinterprete cast.

• Simplify coding using C++11 features.
• Revise Section 14.13.

• Override virtual functions using the override keyword.
• Use the final keyword to prevent further overriding.

• Revised Section 16.2.
• New section on multiple catches.

• Use string to replace C-Strings in the examples.

• Introduce common algorithm development techniques using dynamic programming, divide-and-conquer, and backtracking.
• New example on backtracking algorithms.

• Insertion sort is moved from Chapter 6 here.

• The use of NULL is replaced by nullptr.
• Expand the coverage on iterators for LinkedList iterator.
• Use foreach loop for LinkedList.

• The use of NULL is replaced by nullptr.
• Consistently use the const reference parameters and constant member functions.
• New exercises 21.8-21.11.

• C++11 auto type inference
• Two new programming exercises.

• Passing functions as parameters.
• C++11 lambda functions.
• C++11 new STL algorithms.

• Brand new

• Consistently use the const reference parameters and constant member functions.

• Consistently use the const reference parameters and constant member functions.
• Use adjacency edge lists to store edges Instead of using the adjacency vertex lists. This provides great flexibility in designing resusable code. The weighted edges in the next chapter can be stored using the same adjacency lists.
• The new methods for adding vertices and adding edges.
• New exercises 26.8–26.14.

• Consistently use the const reference parameters and constant member functions.
• Use adjacency edge list to store edges rather than using priority queues to simplify implementations of the MST and SP algorithms.
• A simple O(|V|²) implementation for MST is provided. The O(|E|log|V|) implementation using the priority-queues is now an exercise.
• A simple O(|V|²) implementation for SP is provided. The O(|E|log|V|) implementation using the priority-queues is now an exercise.
• New exercises 27.9–27.13.