define the time and space complexity of an algorithm and about what can i do when the time and space complexity are given and i should write the code corresponding to the restrictions , which i find very difficult.
I am currently trying to make a simple method for an array that would find the highest value. here is currently what i got, but do not know what to change to make it correct.
double FindMax(double stock[], int size){ int size = stock.length(); int max = stock[0];
for(int i = 1; i < size; i++){ if (stock[i] > max) {max = stock{i};} } return max;
after staring at this for awhile, I can't figure out why it won't work. It prints out numbers from 0 to 100, but will print out an absurdly high number as the highest number, like 790 or 640. I can't see why.
Code: #include <cstdlib> #include <ctime> #include <iostream> using namespace std; int find_highest(int array[]); int find_highest (int array[], int size) { int highest_num; for (int i = 1; i < size; ++i) { if (array[i] > array[i-1]) {
Basically, I am suppose to compute 10 numbers and find their highest prime number for each of them. I've already have the inputs working, and set up 2 arrays to store inputs and their highest prime number. But I am uncertain on how to find and store their highest prime number. How to start it off?
i wnt to display student who get highest marks among them...i have code for finding maximum marks from them but don't kne how to print only top 5 student...
Code:
static void Main(string[] args) { Console.WriteLine("Please Enter Number of Students :"); int n = Convert.ToInt32(Console.ReadLine()); StudentDetails[] student = new StudentDetails[n]; for (int row = 0; row < n; row++) { Console.WriteLine("Please Enter Student name :");
it's not my primary language, so my code variables are in my language.
Code:
FILE *eng; eng = fopen("eng.txt", "r"); if(eng == NULL){
[Code]....
fclose(eng); It's a piece of my code. Some explanation: From file, where is full of words under selves. I cut it on word and from word i'm printing:
1) word 2) how many letters in the word 3) word backwards and 4) viz. problem is down
For first: There i have warning: while(feof(eng) == NULL); like (comparison between pointer and integer) i don't get it. For second i have a big problem. I must from every word print the most recurring character.
For example: nondeterministically -> the most are N and I. And if, there is more then one most reccuring char, you choose one of them.
I keep getting an unresolved external symbol error in the double GetHighest function. Ive looked over the code many times and can figure out why its giving me this error.
//Question 1
// Copy source code below and save to a .cpp file (say lab11_01.cpp) and write statements to print what is indicated in the source code. //In this question, you will implement code for finding the highest value in an array, and you do this in a function. //This program gets a series of test scores and calculates and display the highest score.
#include <iostream> #include <iostream> #include <iomanip> using namespace std; // Function prototypes void getTestScores(double[], int); double getHighest(const double[], int);
I have reduced it for lower numbers but for some reason with higher numbers when i get the program to out put all the primes they are in minuses!!!
I need a way to make this even faster, or maybe theres a better mathematical answer, I know that for numbers in their 1,000,000,000,000 have an average of 1 prime every 26.6 numbers (i think thats right there is 37,607,912,018 primes in the number 1,000,000,000,000) is there anyway i can utilize this??
#include <iostream> using namespace std; int main() { int primeanswer = 1,p = 1; for (int i=1;i<35; i++)
I'm having trouble, I want the inner loop to display the lowest and highest score. If I assign initial values for the high and low score, it won't always work (because if no/ all scores are above/ below my initial values...)
But without assigning initial values for highscore and lowscore, One of them will always be undefined during the first runthrough.
#include <iostream> using namespace std; const int AGRADE = 90; const int BGRADE = 80; const int CGRADE = 70; const int DGRADE = 60; int main() {
[code]....
how do i set this up so it stores a low and high score, and then compares those to each next number in the series?
I am trying to correlate the student's highest score with that student's ID. The old code is in blue and the new code is in green which includes a sort. The particular information in question is in red.
Ide1
Code: #include <stdio.h> int main(void) { /*Set up two arrays to include up to 50 elements each.*/ int st_numval_id[50] = {0}, st_val_tstscr[50]= {0}, i = 0, j = 0, temp;
[Code] .....
Enter the student's id and test score:
/*After the following input, then enter 0 to end the input*/
Student ID Test Score Letter Grade ------------ ----------- -------------- 1653 77 C 1945 72 C 1020 50 F 1955 92 A 1900 81 B
ABOVE AVERAGE STUDENTS
Ave Test Score Students Above Ave Number of: A's B's C's D's F's ----------- ---------- --------- --- --- --- --- --- 62.00 4 1 1 2 0 1
THE STUDENT WITH THE HIGHEST TEST SCORE
Student ID Test Score Letter Grade --------- ---------- ------------ 1900 0 F
