Show how to explicitly allocate and deallocate blocks of memory in your language. Show access to different types of memory (i.e., heap, stack, shared, foreign) if applicable. While the C allocation functions are also available in C++, their use is discouraged. Instead, C++ provides new and delete for memory allocation and deallocation. Those function don’t … Continue reading

// C++ LSD Radix Sort example, queue implementation #include <iostream.h> #include <cstdlib.h> #include <ctime.h> using std::cout; // Remove this line for older C++ compilers typedef struct slist_ { int val; struct slist_ *next; } slist; slist *radixsort(slist *L, int t) { int i, j, d, m=1; slist *temp, *head[10], *tail[10]; // Process t digits for … Continue reading

void write_csv_file(double A[], int length, string file_name) //Function that prints array A to a *.csv file { ofstream output(file_name); for(int i = 0; i < length; i++) { output << A[i] << endl; } }

Given two ranges, [a1,a2] and [b1,b2]; then a value s in range [a1,a2] is linearly mapped to a value t in range [b1,b2] when: The task is to write a function/subroutine/… that takes two ranges and a real number, and returns the mapping of the real number from the first to the second range. Use … Continue reading

C is one of the most important and widely used of all programming languages. It is a powerful language that can be used not only to build general-purpose applications but also to write “low-level” programs that interact very closely with the computer hardware. C lets the programmer do things that many other languages do not. … Continue reading

int Find_Greatest_Common_Denominator(int x, int y) //Function that finds the Greatest Common Denominator (“GCD”) between 2 integers { int a; if(x==0) cout << y << endl; if(y==0) cout << x << endl; if(x==y) cout << x << endl; if(x>y) { a = x – y; return Find_Greatest_Common_Denominator(a, y); } if(y>x) { a = y – x; … Continue reading

Find the name of the host on which the routine is running. #include <stdlib.h> #include <stdio.h> #include <limits.h> #include <unistd.h> int main(void) { char name[_POSIX_HOST_NAME_MAX + 1]; return gethostname(name, sizeof name) == -1 || printf(“%s\n”, name) < 0 ? EXIT_FAILURE : EXIT_SUCCESS; } SOURCE Content is available under GNU Free Documentation License 1.2.

From Wikipedia, the free encyclopedia: A happy number is defined by the following process. Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include … Continue reading

The multiplicative digital root (MDR) and multiplicative persistence (MP) of a number, n, is calculated rather like the Digital root except digits are multiplied instead of being added: Set m to n and i to 0. While m has more than one digit: Find a replacement m as the multiplication of the digits of the … Continue reading