The other day I felt my computer files were a little disorganized, so I went through some old files to do some hard-core cleanup. I wanted to purge and archive old programs, documents, and repos. While reviewing the files, I found some old C# code (from the days of when I tried to stay sharp through CodeWars), I wrote to test different sorting algorithms.
Tag Archives: Algorithm
Using Dijkstra’s algorithm to navigate BC Tables
While I was flying home from Directions, I built a small experiment in AL where I used graph theory to navigate tables in BC. Check out the madness in this video:
Sorting Algorithms comparison in NAV AL with Visual Studio Code
In order to exercise in the new NAV Modern Development Environment I thought to implement a comparison of two sorting algorithms directly in Visual Studio Code AL Language: Insertion Sort and Merge Sort.
Most of the sorting examples over the internet are using arrays, but the issue with arrays is they have fixed length that needs to be declared upfront. Of course I didn’t like this even if it is just an example with educational purpose. Or someone maybe will use it also for a real situation, we’ll see.