salty11

I have this issorted code to sort elements of an array. It's very slow as it is right now due to a lot of memory access, number of branch instructions per iteration of the poorly written loops, and unorganized instruction/register usage causing dependencies between instructions. I'm not sure on how …

**I have this timeissorted.c file, and right now it's running at around about 8397599 usec. I'm looking for help toward improving the performance of this code to make it run faster.** #include <stdio.h> #include <stdlib.h> #include <sys/time.h> #include <stdlib.h> static struct timeval start_ts, end_ts, diff_ts; void startClock() { gettimeofday(&start_ts, 0); …

This is one part of my program, I need a loop that checks through the input(specifically the agent numbers) and then outputs the agent numbers that aren't in the input, from 1 to 20(because there should only be 20 agent). [CODE]void not_part() { ins.open(in_file); int i=0; int sum=0; cout<<"AGENTS WHO …

im trying to get this function to show the numbers that are not on the list in the input file, i've written this and it doesnt work, i know theres sometihng wrong with it but im not sure what it is? or how i can fix it to make it …

You are the manager of a travel agency with 20 employees. You have announced a promotional campaign for your agents to sell vacation packages. Each day you will enter the ID number of the agent (#1-#20), the number of packages sold, and the dollar value of the package. Entries will …

In the display function when i output it shows multiple output for some agents, but i only want it to show the final one, how can i do this? [CODE]#include<iostream> #include<fstream> #include<conio.h> #include<iomanip> #include<cmath> #include<string> // Associating program identifiers with external file names #define in_file "data.txt"//input file name #define out_file …

In this program i am trying to find numbers that are multiples of 7,11, or 13, also if the total of the numbers is even or odd also the square root value of each number also if there are any prime numbers in the list [CODE]#include<iostream> #include<iomanip> #include<fstream> #include<cmath> #include<conio.h> …

For this code i am inputing one number and trying to see if it is a perfect number [CODE]#include<iostream> #include<cmath> #include<iomanip> #include<conio.h> using namespace std; void perfect(int); int isfactor(int, int); int N, i; int main() { perfect(N); isfactor(N, i); } int isfactor(int number, int divisor) { if(number%divisor==0) return 1; else …

this code is meant to input words from file, and output to file the amount of letters in them and how many words there are [CODE]#include<iostream> #include<iomanip> #include<fstream> #include<cmath> #include<conio.h> #define in_file "data.txt"//input file name #define out_file "result.txt"//output file name using namespace std; void inputwords(int&, int&); void outputwords(int, int); ifstream …

In this program everything work except the change back, the quarters, dimes, nickels, and pennies wont work, everytihng else works, for my input i used 65.67, which with hst came out to 75.52, the amount tendered was 100. I just need help with getting the quarters, dimes, nickels, and pennies …

I need some help with this program, im obviously not so good with this stuff, but since this is the only one i haev left to make i thought i would ask some of you guys for help the problem is: Write separate programs to do the following: 1) Convert …