City/MathHelper.cpp at master · tschicke/City · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/*
 * MathHelper.cpp
 *
 *  Created on: Jul 29, 2013
 *      Author: Tyler
 */

#include "MathHelper.h"
#include <cmath>

float * MathHelper::SIN_TABLE = 0;

void MathHelper::init() {
	SIN_TABLE = new float[3600];

	for (int i = 0; i < 3600; ++i) {
		SIN_TABLE[i] = sinf(i * 2.f * MATH_PI / 3600.f);
	}
}

void MathHelper::cleanup() {
	delete SIN_TABLE;
}

float MathHelper::sin_float(float radians) {
	radians = fmodf(radians, 2.0 * MATH_PI);
	if (radians < 0) {
		radians += 2.f * MATH_PI;
	}
	return SIN_TABLE[(int) (radians * 572.9578f)];
}

float MathHelper::cos_float(float radians) {
	radians += toRadians(90);
	radians = fmodf(radians, 2.0 * MATH_PI);
	if (radians < 0) {
		radians += 2.f * MATH_PI;
	}
	return SIN_TABLE[(int) (radians * 572.9578f)];
}

float MathHelper::toRadians(float degrees) {
	return degrees * MATH_PI / 180.f;
}

float MathHelper::toDegrees(float radians) {
	return radians * 180.f / MATH_PI;
}

void MathHelper::bubbleSort(int * list, int numElements){
	while(numElements > 1){
		for(int i = 0; i < numElements - 1; ++i){
			int num1 = list[i];
			int num2 = list[i + 1];

			if(num1 > num2){
				list[i] = num2;
				list[i + 1] = num1;
			}
		}

		numElements--;
	}
}

void MathHelper::reverseBubbleSort(int * list, int numElements){
	while(numElements > 1){
		for(int i = 0; i < numElements - 1; ++i){
			int num1 = list[i];
			int num2 = list[i + 1];

			if(num1 < num2){
				list[i] = num2;
				list[i + 1] = num1;
			}
		}

		numElements--;
	}
}