Compiled on turbocpp 4.5.....error is that the final merged array is much bigger with garbage values...
Code:
//cpp program to concatenate 2 arrays
#include<iostream.h>
#include<conio.h>
//the class
class array
[Code] .....
I've come to a point in tuning my algorithm, where I need to sum the elements of two arrays, eg.:
array1: (1,1,1)
array2: (2,2,2)
arrayOut: (3,3,3)
Is there any way how to do that without need to iterate? Some memory hacks?
I have been trying to merge the two arrays in merge sort but I am not able to do so. I am getting only half of the array.
Code:
int i,j,k,a[100],n,temp;
printf("Enter array size: ");
scanf(" %d",&n);
printf("
Enter the numbers:");
[Code] ....
I'm trying to write a code that takes two arrays from the user (presumably in ascending order) and then passes the sizes of both arrays and a pointer to each to a separate "int* mergeArrays" function that will merge sort the two. I've written a lot of the code, but I can't get it to compile. I get errors: lab6.c: In function "main":
lab6.c:31:14: error: expected expression before "int"
mergeArrays(int* firstArray, int size1, int* secondArray, int size2);
^
lab6.c:31:14: error: too few arguments to function "mergeArrays"
[Code] ....
I need to write a function that will merge the content of two sorted arrays of type double values. The function should not assume that both its input parameter arrays are the same length.
Here is my program so far - I know there is alot of errors and mistakes:
Code:
#include<stdio.h>
void merge(int firstArray[],int secondArray[],int size) {
int mergedArray[size],i=0,j=0,k=0;
while(i<size||j<size) {
if(i==size) {
[Code]...
i can't seem to get this merge sort to work. running through gdb though;
Code:
*Filename: mergeSort.c
*Usage: This implements merge sort algorithm to sort and array of numbers.
*/
#include <stdio.h>
#include <stdlib.h>
}
[code]...
Code:
/* Mergesort: Use merge() to sort an array of size n */
#include <stdio.h>
#include <stdlib.h>
void mergesort(int key[], int n) {
int j, k, m, *w;
for (m = 1; m < n; m *= 2)
[Code] .....
Question : Modify mergesort() so that it can be used with an array of any size, not just with a size that is a power of two. Recall that any positive integer can be expressed as a sum of powers of two. For example,
27 = 16 + 8 + 2 + 1
Consider the array as a collection of subarrays of sizes that are powers of two. Sort the subarrays and then use merge() to produce the final sorted array.
I tried so many algorithms and all failed!! What i dont know is how to create subarrays ?
My programs gives a segmentation fault for large n (n=9999999). It works fine for small n. Where n = total numbers to sort
List<long>* Merge(List<long> *ParentList)
{
if(ParentList->length()==1)
{
[Code]....
#include<stdio.h>
#include<stdlib.h>
#include<sys/time.h>
#include<time.h>
#include<math.h>
typedefstruct points{
float axis[2];
[Code] .....
I am attempting to merge binary files. However, this is to no avail. The program keeps segfaulting. I want to merge the buffers the files are stored in and then write the new one to disk. Anyway, here is my code.
Main.cpp:
#include "getsize.h"
long lSize;
char * buffer;
size_t result;
FILE * pFile;
FILE * pFile2;
FILE * pFile3;
void read1() {
pFile = fopen ( "uTorrent.exe", "rb");
[Code] ....
I tried to keep the coding style as similar as possible. I tested these with 4 million (4x1024x1024) 64 bit unsigned integers, Visual Studio 2005, 64 bit mode, Win XP X64, Intel 2600K 3.4ghz cpu. The average time for top down = 3.7 seconds, bottom up = 3.5 seconds.
Code: // tsorttd.h - top down merge sort
template <class T>
T * TopDownMergeSort(T a[], T b[], size_t n) {
TopDownMergeSortAtoA(a, b, 0, n);
[Code]....
Code:
typedef vector<int> LIST; // LIST can be a vector of any comparable type
static LIST merge_sort(LIST &linp){
size_t i, width;
LIST lout(linp.size()); // second list for output
[Code] ....
I'm trying to implement the Merge-Sort algorithm. I only had the pseudocode for it and have some problems coding this into C.
I have only covered pointers recently and I tried using them, which did not work. I started with the code for the merge algorithm and only used a 10 element array, which was already divided into two sorted subarrays:
Code:
#include <stdio.h>#include <stdlib.h>
int main() {
int a[5]={1,5,6,10,13}, b[5]={4,8,9,10,14},c[10], *i,*j,k;
[Code].....
This is the result that I get:
Code: 1 4 5 6 8 9 10 10 13 0
So I think the problem occurs because in the second to last loop i is incremented again, but the end of the array is already reached, and the compiler has no element a[6] to compare with *j in the last run of the loop. Is there generally a better way to implement Merge?
i write code that's merge two linked list without sort ....
node * merage (node * list1, node * list2) {
// check witch list is empty
if (list1 == NULL) return list2;
if (list2 == NULL) return list1;
if ( list1 == NULL && list2 == NULL ) return NULL;
[Code].....
I am getting an error trying to convert from nodeType<Type> to nodeType<Type>* in my recursiveSort function and why this is happening.
#ifndef H_linkedListIterator
#define H_linkedListIterator
#include <iostream>
template <class Type>
struct nodeType {
Type info;
[Code] ....
// mergefile2norecreation.cpp : definisce il punto di ingresso dell'applicazione console.
//
// Filemerge.cpp : definisce il punto di ingresso dell'applicazione console.
//
#include "stdafx.h"
int _tmain(int argc, _TCHAR* argv[]) {
TCHAR inputfile1[MAX_PATH];
TCHAR inputfile2[MAX_PATH];
TCHAR outputfile[MAX_PATH];
[Code] .....
There is a smart way to make a merge sort between 2 file already ordered? I had try it ,and above there is my result,it works but i think that it's possible to do it in a smart way...
I have to merge two sorted files. Algotrithm that i'm using is below, but it reads not all the numbers in the files, and stops, even the files contain the same number of elements. What is wrong, I can't understand.
ifstream f1("E:desc1.txt");
ifstream f2("E:desc2.txt");
ofstream f("E:desc.txt");
cout <<endl<< "Nuerele sortate: " <<endl;
int n1, n2;
f1 >> n1;
f2 >> n2;
[code]...
desc1.txt is:
99 97 95 93 91 89
and desc2.txt is:
100 98 96 94 92 90
and I'm getting this:
100 99 98 97 96 95 94 93 92
I am looking for a function or algorithm to best merge and sort similar content between two lists of unordered strings each in individual files (very large files ~200mb each).
For example, these files have a common first string and are merged based on them:
File 1:
red, apple
green, truck
blue, car
yellow, ball
orange, candy
File 2:
gold, necklace
green, tree
yellow, sticker
blue, water
red, bag
I am looking for the following output:
Output:
red, apple, bag
green, truck, tree
blue, car, water
yellow, ball, sticker
orange, candy
gold, necklace
So I have a file with 2 float numbers like this
0.041631 0.176643
0.364602 0.091331
0.092298 0.487217
0.526750 0.454433
0.233178 0.831292
0.931731 0.568060
0.556094 0.050832
0.767051 0.018915
0.252360 0.298197
0.875981 0.531557
I would like to place the first column in one array and second in another. I am using the merge sort and merge algorithm from my book to sort the first column (x-coord) in descending order and the second column (y-coord) in ascending order. The output would look like this.
(where, x, y)
6: 0.931731 0.018915
10: 0.875981 0.050832
8: 0.767051 0.091331
7: 0.556094 0.176643
4: 0.526750 0.298197
2: 0.364602 0.454433
9: 0.252360 0.487217
5: 0.233178 0.531557
3: 0.092298 0.568060
1: 0.041631 0.831292
I am ignoring the where(line number) for now. The error I get is: cannot convert 'points_struct*' to 'int*' for argument '1' to 'int mergesort(int*, int, int)'.
So my question is how to get my points_struct arrays to work with the algorithm I have from book. Here is what I have so far.
#include<iostream>
#include<fstream>
using namespace std;
[Code].....
I have a solution with multiple projects. Each have an assemblyinfo.cs. file Each of these files have a section that is particular for each project like
[assembly: AssemblyTitle("Activity Manager")]
[assembly: AssemblyDescription("Activity Manager for .Net 3.5 Framework")]
I also have a global assemblyinfo.cs file which has items that are the same for all projects like
[assembly: AssemblyCompany("MyCompany")]
[assembly: AssemblyCopyright("2010 MyCompany Ltd")]
[assembly: AssemblyVersion("11.1.1.18824")]
[assembly: AssemblyFileVersion("11.1.1.18824")]
Is there a way of combining the 2 or including the global section in the assemblyinfo.cs for each project.
In C++ I can do a #include but that doesn't work in c#.
I'm trying to finish this project which is supposed to read two files, and merge them alphabetically. I've written this code, and it compiles. But it isn't actually doing anything??The console opens and closes immediately upon running.
Code:
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <string>
using namespace std;
#define hisFamily "The Adopted.txt" //His family
#define herFamily "The Originals.txt" //Her family
#define ourFamily "The Big Picture.txt" //Our family
[Code] ....
This is in response to the bubble sort and selection sorts for linked lists. On my system, (Intel 2600K, 3.4ghz), it sorts a list with 4,194,304 nodes containing 64 bit unsigned integers in about 1.05 seconds.
Code:
#define NUMLISTS 32
/* number of lists */
typedef unsigned long long UI64;
typedef struct NODE_{
struct NODE_ * next;
UI64 data;
[Code]....
This is in-place merge sort, for merge function.
LinkedListNode::LinkedListNode(int value) {
this->next = NULL;
this->value = value;
}
LinkedListNode *mergeSortedLinkedLists(LinkedListNode *firstList, LinkedListNode *secondList)
[Code] ....
I'm trying to sort a deck from file with merge sort.I have all my code working except merge sort function .
#include<iostream>
#include<fstream>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
int temp;
int br = 1;
[Code] ....
I have written a C++ program that is supposed to open two text files (prog2a.dat and prog2b.dat) and write the contents of a specified range of lines to an output file (outfile.dat). I wrote a program that based on the example we were given (to take lines 5-15 from the first file and lines 4-12 of the second file and merge them into the output file) works perfectly. However, after asking my professor for some clarification on another part of the assignment, I found out I have not done this correctly. I have the code written so that it will always output the range of lines I mentioned earlier, but the program is actually supposed to allow the user to merge the files from the command line using whatever range they want by typing in the following command:
prog2 in1 5-15 in2 4-12 outfile
But I'm not sure how to tweak my current program to allow this to be done.
Here is the code that I have written, keep in mind that this works properly for the way it is written, but not how it is supposed to work for the purposes of the command line (hopefully that makes sense):
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int main() {
// Create output file
std::ofstream outFile("outfile.dat", ios::out);
[Code] .....
Is there any simple way to make this work as I described using the command line? Also, I am supposed to break this up into three files, a header file, the program file, and a test file (the test file contains main() and should close the 3 open files and display any error messages), but I'm getting really confused as to what should go in the header file. I know the header file should contain class definitions and constructors, but don't really know how to make that work for this specific program?
My assignment is to make a program that tests whether something is a Palindrome or not using a recursive function. Also, in order to test what type the Palindrome is (if it is indeed a palindrome) I'll need to merge sort it. Now alphabet characters, spaces, and numbers are all allowed, as long as the spaces line up with the spaces in the original input. And yes this is user inputted. I can show you what I've got so far and then I'll tell you what my problem is.
#include <iostream>
#include <istream>
#include <string>
#include <string.h>
#include <conio.h>
using namespace std;
/************To Test if Palindrome*******************/
bool IsPalindrome(char *str, int size) {
if( str[0] == str[size-1]);
[Code] .....
Now my problem is that I can't seem to get the test to work correctly. Since the word is user inputted I don't have any way of knowing the size so that kind of complicates it a little bit. The other thing is I was told by my professor that I need a boolean flag to make it work, and I need to set the value to the return of the IsPalindrome function. I'm not sure how to do that. I also don't haven't been able to add in the MergeSort yet, so the Order and Type don't really work correctly because I'm not sure how to get int len for it. (len is length)