gcarrillo

#include <stdio.h>                                                              
                                                                                
enum ops {                                                                      
        OP_ADD,                                                                 
        OP_SUB,                                                                 
        OP_MULT                                                                 
};                                                                              
                                                                                
typedef int (*op_function_t)(int x, int y);                                     
                                                                                

gcarrillo

#!/usr/bin/env python
'''
Heapsort
 - Best case:   O(n log n)
 - Average case:O(n log n)
 - Worst case:  O(n log n)
'''

def swap(l, i, j):
    tmp = l[i]

gcarrillo

#!/usr/bin/env python
'''
Insertion sort
 - Best:    O(n)
 - Average: O(n^2)
 - Worst:   O(n^2)
'''

def insertionsort(l):
    for i in xrange(0, len(l)):

gcarrillo

#!/usr/bin/env python
'''
Selection sort
 - Best:    O(n^2)
 - Average: O(n^2)
 - Worst:   O(n^2)
'''

def swap(l, i, j):
    tmp = l[i]

gcarrillo

#!/usr/bin/env python
'''
Mergesort
 - Best:    O(n log n)
 - Average: O(n log n)
 - Worst:   O(n log n)
'''

def merge(A, B):
    result = []

gcarrillo

#!/usr/bin/env python
'''
Quicksort
 - Best case:       O(n log n)
 - Average case:    O(n log n)
 - Worst case:      O(n^2)
'''

import random
random.seed()   # Initialize random number generator.

gcarrillo

#! /bin/sh

i=0

echo -n '|'

while true; do
        case $i in
        0) echo -n '^H|'
                ;;