CCF_100/ASDV-Cpp
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

get nullptr'd lol

Browse Source
This commit is contained in:
Chloe Fontenot 🏳️‍⚧️
2024-03-09 23:17:44 -06:00
parent 5088bded35
commit 756d08231a
107 changed files with 9646 additions and 1888 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
Assignments/MP2_CalebFontenot_clion/main.cpp
View File

@@ -26,6 +26,7 @@ int main(){
std::vector<std::vector<int>> vector;
std::vector<std::tuple<int, int>> highlightTuple; // collection of tuples to highlight
std::tuple result = {0, 0};
int ch;
static int selection = 0;
static int * selectionPointer = &selection;
@@ -56,20 +57,21 @@ int main(){
attrset(A_NORMAL);
endwin();
cout << "\033[2J\033[1;1H"; // Clear screen unicode sequence
highlightTuple.clear();
vector = random2DArray(10, 10);
std::sort(vector.begin(), vector.end());
printf("Binary search is being used to locate the tuples to highlight!\n");
printf("getAverage: %i\n", getAverage(vector));
printf("getRowTotal 0: %i\n", getRowTotal(vector, 0));
printf("getColumnTotal 0: %i\n", getColumnTotal(vector, 0));
printf("getHighestInRow 0: %i\n", getHighestInRow(vector, 0));
highlightTuple.push_back(binarySearch(vector, getHighestInRow(vector, 0)));
printf("getHighestInRow 0: %i\n", getHighestInRow(vector, 0));
highlightTuple.push_back(binarySearch(vector, getHighestInColumn(vector, 0)));
printf("getHighestInColumn 0: %i\n", getHighestInColumn(vector, 0));
highlightTuple.push_back(binarySearch(vector, getHighestInColumn(vector, 0)));
highlightTuple.push_back(binarySearch(vector, getLowestInRow(vector, 3)));
printf("getLowestInRow 3: %i\n", getLowestInRow(vector, 3));
highlightTuple.push_back(binarySearch(vector, getLowestInRow(vector, 3)));
printf("getLowestInColumn 3: %i\n", getLowestInColumn(vector, 3));
highlightTuple.push_back(binarySearch(vector, getLowestInColumn(vector, 3)));
printf("getLowestInColumn 3: %i\n", getLowestInColumn(vector, 3));
printf("2D Vector: %s \n", printVector(vector, highlightTuple).c_str());
cout << "Press Enter to Continue";
getchar();
@@ -83,12 +85,26 @@ int main(){
std::sort(vector.begin(), vector.end());
printf("2D Vector:\n%s\n", printVector(vector).c_str());
printf("getHighestInRow 0: %i\n", getHighestInRow(vector, 0));
std::tuple result = binarySearch(vector, getHighestInRow(vector, 0));
result = binarySearch(vector, getHighestInRow(vector, 0));
printf("binary search for results from getHigestInARow(0): %i, %i\n", get<0>(result), get<1>(result));
cout << "Press Enter to Continue";
getchar();
attron(A_NORMAL);
break;
case 3:
attrset(A_NORMAL);
endwin();
cout << "\033[2J\033[1;1H"; // Clear screen unicode sequence
printf("Highlighting every other tuple...\n");
vector = random2DArray(10, 10);
std::sort(vector.begin(), vector.end());
highlightTuple = highlightEveryOther(10, 10);
printf("2D Vector:\n%s\n", printVector(vector, highlightTuple).c_str());
cout << "Press Enter to Continue";
getchar();
attron(A_NORMAL);
break;
}
break;
@@ -97,7 +113,7 @@ int main(){
}
// Ensure selection stays within bounds
selection = (selection < 0) ? 0 : selection;
selection = (selection > 2) ? 2 : selection;
selection = (selection > 2) ? 3 : selection;
//std::system("clear");
move(0, 0);
printw("%s", printMenu(selectionPointer).c_str());
@@ -112,10 +128,10 @@ int main(){
std::string printMenu(int* selection) {
const int ARRAY_SIZE = 3;
const int ARRAY_SIZE = 4;
std::string outputString = "";
std::string cursor[ARRAY_SIZE] = {"> ", " ", " "};
std::string menu[ARRAY_SIZE] = {"Rock Paper Scissors", "2D Arrays (demonstrates binary search, too!)", "Binary Search"};
std::string cursor[ARRAY_SIZE] = {"> ", " ", " ", " "};
std::string menu[ARRAY_SIZE] = {"Rock Paper Scissors", "2D Arrays (demonstrates binary search, too!)", "Binary Search", "Test color highlighting"};
//printf("%i", *selection);
/*
if (*selection >= ARRAY_SIZE - 1) {