Book Image

Mastering Microsoft Dynamics NAV 2016

By : Rabindra Sah
Book Image

Mastering Microsoft Dynamics NAV 2016

By: Rabindra Sah

Overview of this book

The book begins by giving you a brief introduction to setting up your NAV environment and shows you how to install and configure it according to your requirements. You will then dive deep into the latest design patterns, network architecture, and topologies. We will show you how you can integrate NAV with the Microsoft platform, and secure your deployment by managing roles and permissions. Moving on, we will explain how to monitor and manage server instances using the Administration tool. We’ll discuss how you can take advantage of the expanded extensibility and connectivity capabilities for a tighter integration with the cloud as well as handheld devices. Then, we’ll show you how you can make use of the PowerBI capabilities that have been built into Dynamics NAV. By the end of the book, you will be confident in developing and administering a Dynamics NAV implementation that will leverage all of the new features.
Table of Contents (19 chapters)
Mastering Microsoft Dynamics NAV 2016
Credits
About the Author
About the Reviewer
www.PacktPub.com
Customer Feedback
Preface

Algorithm


It is very important to understand the time and memory/space complexity of the code you write. Most programmers lack the knowledge to do that. It is essential that you figure out the methods to analyze the time and space complexity of the code you write; also, while tuning up the system, you should be able to figure out the so-called non-efficient code and replace it with code that can perform better in the same given parameters.

Note

An algorithm is a step-by-step procedure to solve a problem in a finite amount of time. Some familiar problems solved with algorithms include sorting an array of numbers, finding a specific string in a list, computing the shortest path between two locations, and finding prime factors of a given integer.

In this section of the chapter, we are going to examine the following questions:

  • How can we determine whether an algorithm is efficient?

  • What is the correctness of code?

Given two algorithms that achieve the same goal, how can we do the following:

  • Decide...