Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering Microsoft Dynamics NAV 2016

You're reading from   Mastering Microsoft Dynamics NAV 2016 The compilation of best skillset to harness Microsoft Dynamics NAV for Administrators, Consultants, and Developers

Arrow left icon
Product type Paperback
Published in Mar 2017
Publisher Packt
ISBN-13 9781786464309
Length 450 pages
Edition 1st Edition
Arrow right icon
Author (1):
Arrow left icon
Rabindra Sah Rabindra Sah
Author Profile Icon Rabindra Sah
Rabindra Sah
Arrow right icon
View More author details
Toc

Table of Contents (13) Chapters Close

Preface 1. Microsoft Dynamics NAV Installation FREE CHAPTER 2. Upgraded Features and Configuration in Dynamics NAV 2016 3. The C/AL and VB Programming 4. Testing and Debugging 5. Design and Development Considerations 6. Version Control and Code Management 7. Tuning Up the NAV System 8. Security in Dynamics NAV 2016 9. Upgrade and Migration 10. Interfacing NAV with Other Applications 11. Extending Dynamics NAV 2016 12. The Future of NAV

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...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image