Abstract: Recent advances in graphics workstations allow the development of improved visualization tools for algorithm and program development. Algorithm visualization permits better analysis, development, and presentation of the algorithm characteristics. In this paper, we present a simple technique using tree graphs for the visualization of three sorting algorithms: the bubble sort, the quicksort, and the merge and sort. Key states of the data are displayed on the nodes, while the graph itself represents the underlying structure of the sorting technique. All graphics are displayed under the X window environment using simple graphics and window programming techniques.