Search this site
Embedded Files
Skip to main content
Skip to navigation
likai @ cs-people
Home
ATS
Manipulating flat memory
ML programmer's guide to ATS
Malloc
Schedule
Teaching
CS112 Summer II 2009 TF
Final Project
Homework 1
Homework 2
Homework 3
CS210 Fall 2009 TF
2009-09-09
2009-09-16
2009-09-23
2009-10-07
2009-10-14
2009-10-21
2009-10-28
2009-11-04
2009-11-18
2009-12-02
Getting Started
Programming Assignment 1 Errata
Summary of GDB Hints
CS320 Summer I 2009 TF
2009-05-20
2009-05-27
2009-06-03
2009-06-10
2009-06-17
2009-06-24
Blackjack Game Code
Homework 1
Random Number in ATS
CS350 Spring 2009 TF
2009-01-16
2009-01-23
2009-01-30
2009-02-06
2009-02-13
2009-02-20
2009-02-27
2009-03-07
2009-04-10
2009-04-17
2009-04-24
Cache Replacement Testing
Homework 2
Pthread in C++
Getting Started
Policy
Working with Eclipse
Unit Testing
Blog
likai @ cs-people
2009-05-27
Post date: May 27, 2009 7:03:26 PM
Print a "list0 int"
Insertion sort on list0 int.
How to insert an element into an already sorted list.
Maintain a sorted "result" list and insert each element in the input list to the sorted result.
Merge sort on list0 int.
Merge two already sorted lists.
Divide a list into two lists and merge them.
The code in merge sort has an infinite loop. Extra credit if you can spot where it is.
Report abuse
Page details
Page updated
Report abuse