Comments(2) Use Gnome Partition Editor (gpartd).
Fusion 2.x allows you to resize a disk but does not grow the underlying NTFS partition. Once you’ve resized the disk using the vmware gui, you need to grow the partition. You can get gpartd on a livecd; the application groks a wide variety of file systems including NTFS. Read more »
Comments(1) So the first comment that I received for the Merge Sort post pointed out that my implementation was not very efficient. While the code correctly implements the algorithm, practical choices (such as choice of data structure) make the code very inefficient – the code I show will definitely not execute in O(nlogn) time. I took another swing at the Lisp code, paying closer attention to performance issues.
Comments(3) Merge sort is another simple algorithm that introduces a fairly powerful concept: Divide and Conquer. Like the previous example, we’ll look at the algorithm, a Lisp implementation then look a bit at running time.
Comments(0) So the first algorithm that we’re going to work on is insertion sort. This is a very simple/intuitive routine, the easiest way to think about how it works is to consider how you might sort a handful of cards.
Comments(3) Like most Engineers I occasionally get inspired to pursue extra-curricular technical projects. Over the years, they’ve ranged from simply learning a new language/framework, to hacking around with circuits and micro-controllers to writing (sometimes) useful little applications. Most of the time, there’s nothing interesting to blog about. I think my current project is different and might be worth sharing. Read more »