habibi

#include "ui.h"
#include "io.h"
#include "analyze.h"

#include <stdbool.h>
#include <stdio.h>

//
// Private
//
static void ui_invalid_input()
{
	printf("info> incorrect input \n");
}

static void ui_exit()
{
	printf("info> bye\n");
}

static char ui_get_choice()
{
	char buf[3];

	printf("input> ");
	return read_line(buf, 3) ? buf[0] : 0;
}

static void ui_line(char c, int n)
{
	while (n-- > 0) {
		putchar(c);
	}
	putchar('\n');
}

static void ui_menu_options(const char *options[], int num_options)
{
	int i;

	for (i=0; i<num_options; i++) {
		printf("    %c) %s\n", 'a'+i, options[i]);
	}
}

static void ui_menu()
{
	const char *options[] = {
		"Menu",
		"Exit\n",
		"Bubble sort best case",
		"Bubble sort average case",
		"Bubble sort worst case",
		"Quick sort best case",
		"Quick sort average case",
		"Quick sort worst case",
		"Binary search best case",
		"Binary search average case",
		"Binary search worst case",
		"Linear search best case",
		"Linear search average case",
		"Linear search worst case",
		"Insertion sort best case",
		"Insertion sort average case",
		"Insertion sort worst case",
	};

	ui_line('=', MENU_WIDTH);
	ui_menu_options(options, sizeof(options) / sizeof(char *));
	ui_line('-', MENU_WIDTH);
}

//
// Public

void skriv(result_t *buf)
{
    int i;
    for(i=0;i<RESULT_ROWS;i++)
    {
        printf("%.6e\n" , buf[i].time);

    }
}

//
void ui_run()
{
	bool running, show_menu;
	result_t result[RESULT_ROWS];

	show_menu = true;
	running = true;
	while (running) {
		if (show_menu) {
			show_menu = false;
			ui_menu();
		}
		switch (ui_get_choice()) {
			// House keeping
			case 'a':
				show_menu = true;
				break;
			case 'b':
				running = false;
				break;
			// Bubble sort
			case 'c':
				//start=clock();
				benchmark(bubble_sort_t, best_t, result, RESULT_ROWS);
				//stop=clock();
				printf("todo> implemenet BE + present results in FE\n");
				break;
			// Invalid input
			case 'd':
				benchmark(bubble_sort_t, average_t, result, RESULT_ROWS);
				printf("hej");
				break;
			case 'e':
				benchmark(bubble_sort_t, worst_t, result, RESULT_ROWS);
				break;
			case 'f':
				benchmark(quick_sort_t, best_t, result, RESULT_ROWS);
				break;
			case 'g':
				benchmark(quick_sort_t, average_t, result, RESULT_ROWS);
				break;
			case 'h':
				benchmark(quick_sort_t, worst_t, result, RESULT_ROWS);
				break;
			case 'i':
				benchmark(binary_search_t, best_t, result, RESULT_ROWS);
				break;
			case 'j':
				benchmark(binary_search_t, average_t, result, RESULT_ROWS);
				break;
			case 'k':
				benchmark(binary_search_t, worst_t, result, RESULT_ROWS);
				break;
			case 'l':
				benchmark(linear_search_t, best_t, result, RESULT_ROWS);
				break;
			case 'm':
				benchmark(linear_search_t, average_t, result, RESULT_ROWS);
				break;
			case 'n':
				benchmark(linear_search_t, worst_t, result, RESULT_ROWS);
				break;
			case 'o':
				benchmark(insertion_sort_t, best_t, result, RESULT_ROWS);
				break;
			case 'p':
				benchmark(insertion_sort_t, average_t, result, RESULT_ROWS);
				break;
			case 'q':
				benchmark(insertion_sort_t, worst_t, result, RESULT_ROWS);
				break;
			case 'r':
                skriv(result);
                break;

			default:
				show_menu = false;
				ui_invalid_input();
				break;
		}
	}
	ui_exit();
}