C/C++ :: Quick Sorting Arrays Created With Random Integers
Feb 9, 2014
I am having some problem with my quick sort problem. My program is supposed to create 5 arrays with 5,10,15,and 20 random integers, respectively. Then it should sort those arrays, where the numbers are bigger or smaller than the middle element in the original array! The program I wrote should do that but, its not! The program just keeps running infinitely!
#include <iostream>
#include <cstdlib>
using namespace std;
void p(int k[],int left, int right) {
int i = left, j = right;
I have been tasked with sorting a text file with some numbers in it. For example, there can be 5 numbers in it: 1,2,3, 4, and 5. However, they are out of order (3,2,4,1 and 5). I need the numbers in numerical order. How can you sort the numbers into a new file?
Bubblesorting? I can not use arrays in this program. I have already determined the minimum number in the file.
I tried to sort a large numbers of vector of random integers with std::sort(), but when the number increases over 10M, std::sort returns all zero in values. Does std::sort have a limitation of input numbers?
I am relatively new to C++ and am trying to bubble sort my linked list that creates 100 random integers. Everything works, but I am unsure how to continue this to include a bubble sorting method.
#include "stdafx.h" #include <iostream> using namespace std; class Node{ public: int data; //set data
I am trying to sort a linked list using quick sort in C. Here is my code--Actually, first I am inserting data in the list from a file. For a small file, it's working fine. But for large file it's just not working.
I'm trying to sort the elements in a linked list which contain a variable amount of data in any given case. In the sample code, the code is more static, but I plan on adding it to much more dynamic code once I have it figured out. My main problem is that I am not sure how to sort the linked list while still keeping the correct pointers to the nodes. I thought about writing my own custom quick sort instead of using the C-standard library function, but how I would keep the pointers to the next nodes correct eluded me. Here is my code so far :
I got everything in this code running except for my remove function. What the project does is adds or removes an integer to a chain of integers created by the user. My add function works the first time but after that if I try to remove or add I believe it is pointing to the improper location and I don't know how to fix this....
Here is my code:
Header: // adds "number" to the array pointed to by "arrayPtr" of "size". // Note the size of the array is thus increased. void addNumber(int *& arrayPtr, int number, int &size); // removes a "number" from the "arrayPtr" of "size". // if "number" is not there -- no action
so the program will create a random value for the inflow. The idea is that the internal for loop will continue to run until the fill_level of the reservoir, which starts at 0, hits the capacity. The process of simulating how many years (each iteration of the internal for loop representing a year) is to be repeated 10 times by the parent for loop of the water_level simulation for loop.
The problem is that the random number that is supposed to created are the same number. THey are different every time I run it, but they are the same every time the loops repeat to make a new simulation.
Reading Effective C++ by Scott Meyers, and Item 16 claims that when an array is created, the compiler reserves a block of memory at the very beginning to indicate how many objects are in the array.
n = number of objects |n|index0|index1|...etc
Scott Meyers wrote:This is just an example, of course. Compilers aren't required to implement things this way, though many do.
Supposedly, this how delete knows how many objects to destruct. And if you were to do something like:
int* foo = new int; //Stuff delete[] foo;
Then delete would interpret the first block as the number of items to destruct, then continue on and destruct that many blocks of memory onward, causing UD behavior.
I'm creating a game in C++ and need to generate random numbers. I know about
int main() { srand(time(NULL)); //Initialises randomiser or sum' like that int x=rand%10; //Generates from 0-9 cout<<x; }
Now, I need the best way to generate random numbers. Do I call "srand(time(NULL));" every time I want to randomise? What is the best method to generate a nearly perfect random number?
I may need to call a randomiser more than once a second, so taking second as seed (I believe that's what srand(time(NULL)); does).
This program is sorting a randomized array of integers using the bubblesort algorithm.
I am trying to modify n correct the source code,so that the swapping of two values will be done by a function called swap values() by using call-by-reference but function should have as arguments only the two array elements that must be exchanged. (Note: do not pass the whole array to the function!) .We consider an array with the first element containing the number of elements in the array, followed by 10 randomly initialized integers (elements).
The code must sort the 10 elements in ascending order.
Compile: g++ -Wall sorting.cpp -o sorting */ #include <iostream> #include <stdlib.h> using namespace std; int main() { const int SIZE=10;
I've been currently stuck on a C++ problem. Here's the question:
Write a program that generates one hundred random integers between 0 and 9 and displays the count for each number. (Hint: Use rand()
% 10 to generate a random integer between 0 and 9. Use an array of ten integers, say counts, to store the counts for the number of O's, l 's, . .. , 9's.)
I think I'm pretty close, but I keep on getting "0" for the occurrences (or counts) of each random integer.
#include <iostream> #include <cstdlib> #include <ctime> #include <conio.h> #include <fstream> using namespace std; const int SIZE = 100;
You are to write a C++ program to generate random integers in the range [ LOW = 1, HIGH = 10000 ] and to store them in a vector < int > of size VEC_SIZE = 250. Then, sort the contents of the vector (in ascending order) and display it on stdout.
To sort the contents of a vector, use the sort ( ) function from the STL. In addition to the main ( ) routine, implement the following subroutines in your program:
• void genRndNums ( vector < int >& v ) : This routine generates VEC_SIZE integers and puts them in vector v. Initializes the random number generator (RNG) by calling the function srand ( ) with the seed value SEED = 1, and generates random integers by calling the function rand ( ).
• void printVec ( const vector < int >& v ) : This routine displays the contents of vector v on stdout, printing exactly NO_ITEMS = 12 numbers on a single line, except perhaps the last line. The sorted numbers need to be properly aligned on the output. For each printed number, allocate ITEM_W = 5 spaces on stdout.
Programming Notes:
• You are not allowed to use any I/O functions from the C library, such as scanf or printf. Instead, use the I/O functions from the C++ library, such as cin or cout. • Let v be a vector of integers, then the call: sort ( v.begin ( ), v.end ( ) ) sorts the elements of v in ascending order. The detailed description of the sort ( ) routine can be found on the course web site and in the course textbook. • Execute the srand ( ) function only once before generating the first random integer with the given seed value SEED. The rand ( ) function generates a random integer in the range [ 0, RAND_MAX ], where the constant value RAND_MAX is the largest random integer returned by the rand ( ) function and its value is system dependent. To normalize the return value to a value in the range [ LOW, HIGH ], execute: rand ( ) % ( HIGH – LOW + 1 ) + LOW.
The program I am stuck on is used to generate random numbers, then sort them (found in Chapter 23, p. 212). When I compile it, I get an error stating "break statement not within loop or switch. I'm finding that there is an issue with a break statement, but I don't know enough yet.
Code: /* Will generate random numbers, then sort them.*/
So the question is to let the user put in two integers and put each integer in an array as separate numbers, and then sum these arrays together, so putting in the array is not so difficult, only problem i am having is first when the user have to input the first integer, he have to put space after each number, second then I am not sure how to sum them up, so if 45676 is first array and 56717 is second, we have to start summing them up from 6 and 7 (the last numbers). Here is what I did for now:
#include <iostream> using namespace std; int main () { char Num1[5], Num2[5]; int i1; int i2; cout << "input the first number" << endl; for (i1=0; i1<5; i1++) cin >> Num1[i1];
I am trying sort my Calorie array and day array corresponding to each other but how to start i cant grasp the concept for some reason. I want it to sort by calories in descending order.
So instead of this...
Day: Calories:
1 200 2 500 3 400 4 600 5 100
I want this.....
5 100 1 200 3 400 2 500 4 600
#include <cstdlib> #include <iostream> using namespace std; //Prototypes int getDays(int); void getCal(int*,int); float calcSum(float,int*,int);
#include <iostream> #include <fstream> #include <cstdlib> #include <ctime> using namespace std; int main () { ofstream fout("datain.txt",ios::out); int array[6][6];
Add a program that declares two arrays of 5 integers each. Provide one function to load one array with random numbers from 1 to 25, another to fill the other array with user supplied values, and a third function to print an array. The main function should declare the arrays and use the functions to fill each array and print them both.
The code i have so far is #include <cstdlib> #include <iostream> using namespace std; void printaaray(int printarray1[], int printarray2);
I am trying to create a program that will read data from a text file into a string. Afterwards I need to sort the data in ascending order and print it. So far my program reads the data but I'm not sure how to go about indexing the array.
I'm trying to write a program that should output, in a tabular form, the name of the algorithm, size of the array, number of comparisons and number of swaps. I am really, really, really bad at arrays and comprehending how to output variables from several. Especially in tabular form />
My questions: 1 - How do I make the array size change from 10 to 100 to 1000? 2 - How do I populate the array's with random non-repeating numbers? 3 - How do I make each algorithm count the # of comparisons and swaps? 4 - How do I return the counted comparisons AND swaps (in one return function??) and then print them?
Using PIONTER NOTATION ONLY, write a function that receives two arrays of integers like A and B above. The function should swap the values in A and B. You may NOT use array notation [ ]. Also, you have to use pointers to move among array cells. Note: Both arrays are of the same size, and size should be variable in the function.
Having trouble with homework involving (title). Here is the assignment:Write a program that allows the user to enter 10 numbers from the keyboard. Sort the numbers using any sort routine you wish. The output from your program should be 2 columns of numbers. The left column should be the numbers in the order they were originally entered and the right column should be the sorted list. The columns should be labeled. You will need 2 arrays to accomplish this.
Use separate functions for input, sorting, and printing.So, I have to use separate functions for each of these. I would think it would be easiest to do the input in Main() and then the sorting and printing in another function, but of course since you can't return arrays I am kind of stuck on how I return the new array after sorting. I thought about doing the sorting in Main(), but then I would need to still do the original arrays input in a function and would still run into the same problem.
Here is what I have so far:
Code:
//Cameron Taylor #include <stdio.h> #define MAXARRAY 10 int highLow(int[], int); int print(int[], int[], int); int main (){ int unsorted[MAXARRAY], i, j, temp;
[Code]...
I know it seems simplistic right now, but I am just trying to get it to work first and then go back and beautify it up a bit.
Write a program using user-defined function to merge the contents of two sorted arrays A & B into third array C. Assuming array A is sorted in ascending order, B is sorted in descending order, the resultant array is required to be in ascending order.
