I think I just need to tell the sort function sort by ascending order except when you encounter "a" "e" "i" "o" or "u" but am not sure how. Would it have something to do with the p parameter?
Well if you want to do that, then use a compare function and pass it to std::sort;
It might look something like this :
bool myComp(char a, char b)
{
string str = "aeiou";
if( str.find(a) != string::npos)
return true;
if( str.find(b) != string::npos)
return true;
else return a < b;
}
//check out the code snippet, here int random(int low, int high) { return }
//use logic to find the min element
//assign initial min element to A[0];
//search through loop seeing if other element's value are
//greater than min element value if so the reassign min element
//other wise keep searching
int getMin(int A[], int max) {
...
}
//same as min, but use ">" when comparing
int getMax(int A[], int max) {
...
}
//create a temp variable and assign it to first
//assign second to first
//assign temp to first
void swap(int &first, int &second) {
...
}
int Array[4] = {4,2,2,1};
std::sort(Array,Array+4); //now array is {1,2,3,4};
for(int i = 0; i < 4; i++) Array[i] *=2; //now array is {1,4,6,8};
//print out the array.
This is a great way to think outside the box, but I do not think it is a better solution because it delegates unnecessary work to the end user. I know I would be frustrated with software that did this to me, and I do not get frustrated easily. :D
Yea, I think he should learn the "art of sorting" as it would provide him with more knowledge. But what I said was just a suggestion. Of course in a real software, it should be user friendly as possible.
Iwhen to use a void function verses a bool or int or other type of function.
Whenever you create a function, you need to know what it does first. Does it sort an array, does it return the square of a number, does it print a triangle? Whatever, it does, you need to know its objective. After knowing its objective, you can easily figure out what type function you need. If it calculate the square of a number then make it return int, since it make sense to return the square of number. If it sorts an array, then it should be void function because array are pointers. If it just prints stuff then make it void because there is no need to return anything. So analyze what a function does and then look at the different possibilities, and pick one that fits the situation.
Also how to know what to call into the Function?
Again this is when you know what you want case. When you know what a function does and you know what you need it to do, then passing the required parameters isn't hard. Also you should have functions that you don't use. The reason you should create functions is for clarity, mostly. So if you decide to create a function make sure you use it, its not too big, and you know what its supposed to do. After …
What you could do is, since you are getting inputs, you can make sure that the inputs are greater than the last input.
example run :
Please enter a number : 3
Please enter a number greater than 3 : 5
Please enter a number greater than 5 : 23
Please enter a number greater than 23 : -42
<Invalid choice>
Please enter a number greater than 23 : 45
//and so on
switch(opt) { case 1: std::sort(array,array+MAX,sortByID); break; case 2: std::sort(array,array+MAX,sortByName); break; case 3: std::sort(array,array+MAX,sortByNationality);break; }
this part i also not understand std::sort(array,array+MAX,sortByID)--->what is the purpose for this?? o.0''
You know the function call says a lot there :
case 1: std::sort(array,array+MAX,sortByID); break;
If the users picks 1 the do the following :
std::sort(array,array+MAX,sortByID); break;
std:: <-- from the standard namespace sort(...) from the standard namespace use its sort functions
sort(array, array + MAX, sortByID);
- Reads as, sort array from the beginning up until Its end, and use the compare function that is passed to it, which happens to sort by id.
Remembers, if Array is an array data_type, then its name is the first address that it points to, so its element 0. Similarly, Array + 1, is the first element plus 1 over, which is the second element, and Array + MAX, is the first element plus the one-pass-the end element. It is one passed the end element because the sort function uses '<' operator and not the '<=' operator in its for loop.
The same could be said for the other case in the switch statement.
Choosing 2 was for demonstrative purpose, it could have been 1000. It represent the max number of student allowed.
"Q: 1. From the function above, why sometime he use MAX sometime use MAX_STUDENT and MAX_SIZE?? "
The name does not matter. The function prototype can has its own arguments with its own unique name.
"Is the function must use "const" / "unsigned int"? Can i just declare like void display( student array[], int MAX);??"
Yes you can, although you might have to typecast it. The use of unsigned int is because there will never be a negative students, just 0 to max number of students.
Does anyone know how to correctly add a 3rd party library to NetBeans?
I have NetBeans 6.7.1
The library is from this site : Link. Its called wheels, and its for my class.
It comes in a zip file.
What I tried was this :
1) Set the zip file into my c drive 2) Start up netbeans 3) Click tools->library 4) Click class Libraries 5) click new Library 6) Called it Wheels 7) Under classPath tab , I set the zip file directory 8) same as 7 for source tab 9) Click OK
10) Try to import it like so : import Wheels.user.*; and Error occurred.
1) First create a prime number generator 2) The adjust it accodignly to what you need it.
A prime number is one where its 2>= | n | < MAX, n != even, n is evenly divisible its self and 1 only.
A few primes are 2,3,5,7,11.
5 is a prime because its divisible only by 1 and its self evenly. 5/5 = 1 with 0 remainder 5/1 = 5 with 0 remainder
5 mod 4 != 0 5 mod 3 != 0 5 mod 2 != 0
Some hints. Create a isPrime(int num), function.
bool isPrime(int num)
{
//if num is equal to 2 then return true;
//check if num is divisible by anything else other than its self
for( i = 2; i < num; i++)
{
// if num mod i is equal to 0 then num is not a prime number so return false
}
//if it passed the loop then it is a prime number so return true
}
Now inside your main use a for loop to check is a number is prime
//inside your main
for i is equal to 2, until MAX
{
//call isPrime with the argument being i. check if it return true
// if it return true then print to screen that it is a prime
//else do nothing
}
After you get this working, then change it to what you need it to be.
Player* temp;
//create 3 objects in vector
temp = new Player(300, 300); // You ask for memory for temp
Players.push_back(temp);
Players.back()->Load("enemy.bmp");
temp = new Player(400, 300); // You again ask for memory for temp.
//code removed...
//...
//...
temp = new Player(350, 100); //later on you again ask for memory for temp.
// So the previous memory allocated is lost. You should delete temp before asking for memory.
let me start you off. This snippet generates prime up to 100. Fill in the conditions. Its in java...hehe. So you need to understand the logic and convert it. Then you can fill in the needed requirements.
package helloworld;
public class Main
{
static boolean isPrime(int num)
{
if(num < 2) return false;
if(num == 2)
return true;
for(int i = 2; i < num; i++)
{
if(num % i == 0)
return false;
}
return true;
}
public static void main(String[] args)
{
for(int i = 0; i < 100; i++ )
if(isPrime(i))
System.out.print(i + " is a prime\n");
}
}
