MaxGCoding.com

A Software Engineering Space

Creating a Gopher Server with Perl

What IS Gopher? Long before the Go programming language adopt the gopher as its logo, and before the “World Wide Web” came to dominate the the internet with HTTP, there was Gopher. Gopher was a menu driven text only protocol for delivering content over a network. Colleges, Universities, and Companies all used Gopher for hosting […]

Bidirectional Iterative Deepening Depth First Search: The shortest path algorithm with the longest name.

Say this one 10 times fast: Bidirectional Iterative Deepening Depth Limited Depth First Search Bidirectional Iterative Deepening Depth First Search(BDIDDFS), some times also called Bidirectional Iterative Deepening Depth Limited Depth First Search by those amongst us who like unnecessarily long names, is a graph traversal/search technique. Originally developed by Richard Korf at Colombia University, and […]

Tree Sort: an online O(n log n) sorting algorithm

Sorting: Faster is Better Tree sort is one of the less discussed sorting algorithms. The three elementary sorting Algorithms bubble sort, insertion sort, and selection sort are all worst case quadratic time algorithms. Many sorting Algorithms with better than quadratic worst case running times have been discovered, many of which have an average  and worst […]