AnIllustrativeIntroductiontoAlgorithms

AN ILLUSTRATIVE INTRODUCTION TO ALGORITHMS Dino Cajic Copyright © 2019 by Dino Cajic All rights reserved. This book or any portion thereof may not be reproduced or used in any manner whatsoever without the express written permission of the copyright owner except for the use of brief quotations in a book review. First Edition 2019 This book is dedicated to my wife Amira and my son Harrison. Amira, you believed in me every step of the way and pushed me to finish this book. Harrison, your excitement was intoxicating. Every time you said, “I want to go to the bookstore to buy your book,” it pushed me to make you proud. CONTENTS Chapter 0: Introduction Chapter 1: Big O Complexity Chapter 2: Lower Bounds Chapter 3: Master Theorem Chapter 4: Bubble Sort Chapter 5: Insertion Sort Chapter 6: Divide and Conquer Chapter 7: Merge Sort Chapter 8: Quick Sort Chapter 9: Heap Data Structure 9.1 Creating a heap from an array 9.2 Constructing Min-Heap from a Tree 9.3 Constructing Min-Heap from an Array 9.4 Constructing Max-Heap from a Tree 9.5 Constructing Max-Heap from an Array 9.6 Deleting a Node from Min-Heap Chapter 10: Heap Sort Chapter ......