[JMurray308]

//i am failing and getting errors with pointer notation in this program and it has been pointed out that
//search list is sposed to work with pointer notation

//This program demonstrates a linear search to verify lottery numbers present or not present in a
//in ten tickets.

#include <iostream>
using namespace std;

//function prototypes


int main()
{   
     int searchList(int [], int, int);
	 const int SIZE = 10;

	int results, value;   //declare variables
	int number[SIZE] = {13579, 26791, 26792, 33445, 55555,62483, 77777, 79422, 85647, 93121};
	int *numPtr;
	//declare fixed array of chosen tickets

	numPtr = number;

	cout << "The numbers in number array are:\n";
	for (int index = 0; index < SIZE; index++)
	{
		cout << *numPtr << " ";
	    numPtr++;
	}

	cout << "Please enter the ticket number:    " <<endl;  //get user input
	cin >> value;
	results = searchList(number, SIZE, value);   //perform search list
	

	
	if (results == -1)
		cout << "You did not win the lottery.\n";  //declare winner
	else
	{
		cout << "You won the lottery";
		cout << (results + 1) << ".\n";
	}
	return 0;
}




int searchList(int list[], int SIZE, int value)  //declare function header
{
	int *numPtr = list;   //declare variables
	int position = -1;
	bool found = false;

	while (numPtr <= &list[SIZE-1]) //establish while loop
	{
		if(*numPtr == value)
		{
			found = true;
			position = *numPtr;
		}
		numPtr++;
	}
	return position;
}

This post has been edited by jimblumberg: 21 September 2012 - 05:48 AM
Reason for edit:: Took question out of the code tags.

[jimblumberg]

Please post help questions in the C++ forum, not the challenge forum.

If you are getting compiler errors, post the error messages exactly as they appear in your development environment. Otherwise please ask specific questions about the code you posted. Why are you failing?


Jim

This post has been edited by jimblumberg: 21 September 2012 - 05:50 AM

[baavgai]

In your searchList, you have a found flag but don't really use it. You're loop just checks for end, why not loop for SIZE and maybe check that flag. When you find the value, you assign the VALUE to position?!? You really want to assign the current position to position. Time to rethink this a little.

I'd start with:

// I'd forget list as an argument
// it might just be confusing you
// int searchList(int list[], int SIZE, int value) {
int searchList(int *numPtr, int SIZE, int value) {
	// let's just loop for the number of elements in the list
	for(int pos=0; pos<SIZE; pos++) {
		// your code here
	}
	// if you made it this far, you didn't find anything
	// so, this value will always be fail
	return -1;
}

Hope this helps.

[JMurray308]

//This program demonstrates a linerar search to verify lottery numbers present or not present in a 
//in ten tickets and i can not get it to switch over to pointer notation...

#include <iostream>
using namespace std;

//function prototypes


int main()
{   
     int searchList(int [], int, int);   //declare variables
	 const int SIZE = 10;

	int results, value;   //declare variables
	int number[SIZE] = {13579, 26791, 26792, 33445, 55555,62483, 77777, 79422, 85647, 93121};
	int *numPtr;
	//declare fixed array of chosen tickets

	numPtr = number;


	cout << "Please enter the ticket number:    " <<endl;  //get user input
	cin >> value;
	results = searchList(number, SIZE, value);   //perform search list
	

	
	if (results == -1)
		cout << "You did not win the lottery.\n";  //declare winner
	else
	{
		cout << "You won the lottery";
		cout << (results + 1) << ".\n";
	}
	return 0;
}




int searchList(int list[], int SIZE, int value)  //declare function header
{
	int *numPtr = list;   //declare variables
	int position = -1;
	bool found = false;

	while (numPtr <= &list[SIZE-1]) //establish while loop
	{
		if(*numPtr == value)   //check for match
		{
			found = true;
			position = *numPtr;
		}
		numPtr++;   //increment numPtr
	}
	return position;
}

[Salem_c]

You would need to post your observations / error messages.

Because it does exactly what I would expect from looking at the code.

$ g++ foo.cpp
$ ./a.out 
Please enter the ticket number:    
55555
You won the lottery55556.

[Skydiver]

What do you mean by "pointer notation in sorting"
Are you looking to change:

int searchList(int list[], int SIZE, int value)

to

int searchList(int * list, int SIZE, int value)

or

int * searchList(int * list, int SIZE, int value)

?

Also, your title has the word "sorting", but you only seem to be searching.