Book Image

Julia 1.0 Programming Cookbook

By : Bogumił Kamiński, Przemysław Szufel
Book Image

Julia 1.0 Programming Cookbook

By: Bogumił Kamiński, Przemysław Szufel

Overview of this book

Julia, with its dynamic nature and high-performance, provides comparatively minimal time for the development of computational models with easy-to-maintain computational code. This book will be your solution-based guide as it will take you through different programming aspects with Julia. Starting with the new features of Julia 1.0, each recipe addresses a specific problem, providing a solution and explaining how it works. You will work with the powerful Julia tools and data structures along with the most popular Julia packages. You will learn to create vectors, handle variables, and work with functions. You will be introduced to various recipes for numerical computing, distributed computing, and achieving high performance. You will see how to optimize data science programs with parallel computing and memory allocation. We will look into more advanced concepts such as metaprogramming and functional programming. Finally, you will learn how to tackle issues while working with databases and data processing, and will learn about on data science problems, data modeling, data analysis, data manipulation, parallel processing, and cloud computing with Julia. By the end of the book, you will have acquired the skills to work more effectively with your data
Table of Contents (18 chapters)
Title Page
Copyright and Credits
Dedication
About Packt
Contributors
Preface
Index

Using array views to avoid memory allocation


Sudoku is a popular mathematical puzzle. If you have never played this game it is worth reading a description of it at https://www.kristanix.com/sudokuepic/sudoku-rules.php or https://en.wikipedia.org/wiki/Sudoku.

In this recipe, we will show how you can solve this puzzle using a backtracking approach. The general idea of this algorithm is to incrementally test candidate solutions of Sudoku, and if they fail, go back (backtrack) one step. You can read more about this method at https://www.geeksforgeeks.org/backtracking-introduction/ or https://en.wikipedia.org/wiki/Backtracking.

Solving Sudoku using backtracking is a basic computational technique. In this recipe, we will show how using array views can improve the performance of such code.

Getting ready

We want to solve 50 Sudoku problems specified in the Project Euler problem 96, see https://projecteuler.net/problem=96. The task is to find the sum of 50 three-digit numbers present in the top left...