Question

Define a structure called Date with month, day and year as its only data members, Time with hour and minute as its only members and Event with desc (a c-string for description of maximum size 80), date (of type Date) and time (of type Time).

Write a readEvents() function that will keep asking the user if he or she wants to add a new event. As long as the user answers with a 'y' or 'Y', allocate memory dynamically for an Event structure, storing the pointer returned by new in the array of Event pointers and then read the Event data from the keyboard and store them in the Event just created. Dates should be entered like 5/21/20 and times as 10:15. When finished entering the Events, the function will return the number of Events entered.

Write a sort-desc() function to sort the Events by their description by rearranging the pointers (rather than the structures), by passing it the array of pointers and the number of Events created. Use a swapPtrs() function to swap pointers.

Write another sort-date() function that takes the Events array and size and sorts them by date.

Write a linear search function that takes the array of sorted Event pointers, array size and a string and displays the first Event it finds whose description contains the specified string. Consider using strstr() function to do linear search for a c-string within another c-string:

if(strstr(events[i] -> desc, searchStr)) //search for searchStr string in events[i] -> desc

Write a binary search function that takes a month, as well as the array of pointers sorted by date and the array size and searches for and displays all Events found for the specified month. If not found, notify the user that it was not found.

Declare an array of Event pointers of MAX (50) size in main and pass it and the MAX size to readEvents function.

Call display() function from main that takes the array of Event pointers and number of Events created and prints the Events entered. Print Events like so:

Im having trouble with my code working. I have writeen it far enough to where it runs but crashes 1/2 way through can anyone help? Any help is appreciated!

Answer 1

#include <iostream>
#include <string.h>

using namespace std;

struct Date{
int month;
int day;
int year;
};

struct Time{
int hour;
int min;
};

struct Event{
char desc[80];
Date myDate;
Time myTime;
};

int readEvents(Event* myEvents[], int max){
char choice = 'n';
int i= 0;

char slash_dummy;
char colon;

while(true && i < max){
cout << "Create an event [y/n]? ";
cin >> choice;

if( choice == 'y' || choice == 'Y'){
myEvents[i] = new Event;

cout << "Enter the description:\n";
cin.ignore();
cin.getline(myEvents[i]->desc,sizeof(myEvents[i]->desc));

cout << "Enter date (MM/DD/YY) \n";
cin >> myEvents[i]->myDate.month >> slash_dummy >> myEvents[i]->myDate.day >> slash_dummy >> myEvents[i]->myDate.year;

cout << "Enter time: \n";
cin >> myEvents[i]->myTime.min >> colon >> myEvents[i]->myTime.hour;

}
else{
break;
}

i++;

}

return i;
}

void display(Event* myEvents[], int eventCount){
for(int i=0; i<eventCount; i++){
cout << myEvents[i]->desc << endl;
cout << myEvents[i]->myDate.month << "/" << myEvents[i]->myDate.day << "/" << myEvents[i]->myDate.year << " " << myEvents[i]->myTime.min << ":" << myEvents[i]->myTime.hour << endl;
}
}

//sort by description
void sortByDesc(Event* myEvents[], int eventCount){
bool swapped;

do{
swapped = false;
for(int i=0; i<eventCount-1; i++){
if( strcmp(myEvents[i]->desc, myEvents[i+1]->desc) > 0){
swap(myEvents[i], myEvents[i+1]);
swapped = true;
}
}
}while (swapped);

}

//sort by description
void sortByDate(Event* myEvents[], int eventCount){
bool swapped;

do{
swapped = false;
for(int i=0; i<eventCount-1; i++){
if( (myEvents[i]->myDate.day > myEvents[i+1]->myDate.day) &&
(myEvents[i]->myDate.month > myEvents[i+1]->myDate.month) &&
(myEvents[i]->myDate.year > myEvents[i+1]->myDate.year) ){
swap(myEvents[i], myEvents[i+1]);
swapped = true;
}
}
}while (swapped);
}

void linSearch(Event* myEvents[], int eventCount, char* searchStr){
for (int i = 0; i < eventCount; i++)
if (strstr(myEvents[i]->desc, searchStr) != NULL){
cout << myEvents[i]->desc << endl;
cout << myEvents[i]->myDate.month << "/" << myEvents[i]->myDate.day << "/" << myEvents[i]->myDate.year << " " << myEvents[i]->myTime.min << ":" << myEvents[i]->myTime.hour << endl;
}

}

void binSearch(Event* myEvents[], int eventCount, int month){
int l = 0;
int r = eventCount-1;

while (l <= r)
{
int m = l + (r-l)/2;

// Check if month is present at mid
if (myEvents[m]->myDate.month == month){
cout << myEvents[m]->desc << endl;
cout << myEvents[m]->myDate.month << "/" << myEvents[m]->myDate.day << "/" << myEvents[m]->myDate.year << " " << myEvents[m]->myTime.min << ":" << myEvents[m]->myTime.hour << endl;
}

// If Month greater, ignore left half
if (myEvents[m]->myDate.month < month)
l = m + 1;

// If Month is smaller, ignore right half
else
r = m - 1;
}
}

int main()
{
Event* myEvents[50];
char str[200];
int total = readEvents(myEvents, 50);
int month;

cout << "Events entered:\n";
display(myEvents, total);

cout << "Events sorted by description:\n";
sortByDesc(myEvents, total);
display(myEvents, total);

cout << "Enter a search string: ";
cin.ignore();
cin.getline(str,sizeof(str));
linSearch(myEvents, total, str);

cout << "Events sorted by Date:\n";
sortByDate(myEvents, total);
display(myEvents, total);

cout << "Enter a month to list Events for: ";
cin >> month;
binSearch(myEvents, total, month);
return 0;
}

Create an event [y/n]? y Enter the description: Submit 839 assignment by Enter date (MM/DD/YY) 11/30/2018 Enter time: 23:59 Create an event [y/n]? y Enter the description: Dentist Appointment Enter date (MM/DD/YY) 12/5/2018 Enter time: 9:30 Create an event [y/n]? n Events entered: Submit 839 assignment by 11/30/2018 23:59 Dentist Appointment 12/5/2018 9:30 Events sorted by description: Dentist Appointment 12/5/2018 9:38 Submit 839 assignment by 11/30/2018 23:59 Enter a search string: den Events sorted by Date: Dentist Appointment 12/5/2018 9:30 Submit 839 assignment by 11/30/2018 23:59

Hope this may help you

Thank you ??