Thread: Decidedly average homework problem

Hey guyz this is gonna be my last question (THANKS IN ADVANCE):

4. Display Data
Write a function to read and display the contents of names and marks. You then ask the user for a name and using the linear search return the index to the user. If -1 is returned then the name is not in the file. Otherwise write out the name and mark for that student.
Next, sort the arrays, write them out and then ask the user for a name to search for. This time use the binarySearch to return -1 or an index. Display the student’s name and mark if found.

Code:

void getNames(ifstream& inStream, string names[], int marks[], int numElts);
int linearSearch(const string names[], int numElts,string who);
int binarySearch(const string names[], int numElts,string who);
void selectionSort(string names[], int marks[],int numElts);
void displayData(const string names[], const int marks[], int numElts);
int main()
{
	string names[NUM_NAMES];
int marks[NUM_NAMES];
	ifstream inStream;

int index;
	string searchWho;

AND YEA GUYZ I WAS MISSING THE FOLLLOWING INFO ON THE LAST 4 QUESTIONS I PUT UP:

File for names and marks:

Collins Bill 80
Smith Bart 75
Allen Jim 82
Griffin Jim 55
Stamey Marty 90
Rose Geri 78
Taylor Terri 56
Johnson Jill 77
Allison Jeff 45
Looney Joe 89
Wolfe Bill 63
James Jean 72
Weaver Jim 77
Pore Bob 91
Rutherford Greg 42
Javens Renee 74
Harrison Rose 58
Setzer Cathy 93
Pike Gordon 48
Holland Beth 79

What's the question?

That's not challenging either, this is a craptastically boring homework assignment at best. You're trolling, aren't you? I have this feeling... I can tell by the pixels.

the question is written at the top!

kk i will write it again (and by the question i mean intructions that r given to write this program):


4. Display Data
Write a function to read and display the contents of names and marks. You then ask the user for a name and using the linear search return the index to the user. If -1 is returned then the name is not in the file. Otherwise write out the name and mark for that student.
Next, sort the arrays, write them out and then ask the user for a name to search for. This time use the binarySearch to return -1 or an index. Display the student’s name and mark if found.

Learn what a function is, how it works, and how to write them.

Then Google each of those search methods and learn them, then write the code.

There's a lot of pieces to this, and if you don't know C++ and took this assignment then you have a lot more problems. You need to learn C++, and write some simple programs and work up from there.

cprogramming.com
cplusplus.com

i totaly get ur point....i do understand this language....i just need help with recrusion...plz help me and stop giving me stupid advices...if u dont wanna help then plz let others help me(with all due respect)...ty

cmon u guyz......i no u all know how to do this problem......dont listen to since....he is a bad person.....just help me out....im just asking for a few clues......ty

u little (cin << insert insulting word here)............ all i wanted was some help from YOU. if i wanted help from the internet, i would have gone there first. Now, you've proved that these forums are useless and all of u guys are pansies looking from some attention. Good luck in life, loser.

> i just need help with recrusion...

Recursion is just a function designed to call itself. For example, the trick to a working binary search is that you have to make the search space smaller with every call, and to do that appropriately, you exclude half of it every time.

So the algorithm is something like this:
1. Find the midpoint
2. Check if the midpoint is the item
2a. If it is, you're done.
2b. If it isn't and there's more than two items, split the list by the midpoint On the other hand, if you've reduced the list and haven't found the item, the search failed.
3. Search the new list from step 1.

The search space needs to be sorted (ascending or descending) for the binary search to work, because again the point is to ignore half the search space every pass. Anyway, for a recursive function to be considered working, it has to know when to stop, and that is step 2 of my explanation.

And make sure your version works with a search space of 2 items.

Code:

u little (cin << insert insulting word here)

The irony...she BURNS!!!!