Kirsten Taing meylingtaing

## colorizer.html

<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <meta name="viewport"
   content="width=device-width, initial-scale=1, shrink-to-fit=no">
  <link rel="stylesheet" href="main.css">
  <link rel="stylesheet" href="colors.css">
  <link rel="stylesheet"

## sum_abundant_nums.c
#include <stdio.h>
#include <math.h>
#include <stdlib.h>

#define MAX 28123

int get_divisors(int, int **);

int main(void) {
	int *divisors;

## get_divisors.c
#include <stdio.h>
#include <math.h>
#include <stdlib.h>

int get_divisors(int, int **);

int main(void) {
	int *divisors;
	int num_divisors = get_divisors(100, &divisors);
	int i;

## llist.c
/* llist.c
 * Generic Linked List implementation
 */

#include <stdlib.h>
#include <stdio.h>
#include "llist.h"

llist *llist_create(void *new_data)
{

## Sort.java
import java.util.Arrays;

public class Sort
{
	/*
		Selection is an in-place sort
		Time: N^2
		The time it takes to sort is independent of how well sorted the array
		already is
	*/

	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<meta name="viewport"
	content="width=device-width, initial-scale=1, shrink-to-fit=no">
	<link rel="stylesheet" href="main.css">
	<link rel="stylesheet" href="colors.css">
	<link rel="stylesheet"
	#include <stdio.h>
	#include <math.h>
	#include <stdlib.h>

	#define MAX 28123

	int get_divisors(int, int **);

	int main(void) {
	int *divisors;
	/* llist.c
	* Generic Linked List implementation
	*/

	#include <stdlib.h>
	#include <stdio.h>
	#include "llist.h"

	llist llist_create(void new_data)
	{
	import java.util.Arrays;

	public class Sort
	{
	/*
	Selection is an in-place sort
	Time: N^2
	The time it takes to sort is independent of how well sorted the array
	already is
	*/