45. Given an array A(I) of 100 16-bit signed numbers stored in memory starting at address A00016, write a program to generate two arrays from the given array such that one array P(J) consists of all the positive numbers and the other N(K) contains all the negative numbers. Store the array of positive numbers in memory starting at offset address B00016 and the array of negative numbers starting at offset address C00016-

USING C++ Create two arrays of 1000 (try 10,000 too) numbers each. Populate both arrays with random numbers or use a data reading routine to read in one of the numerical data columns. Use the library routine qsort (http://www.cppreference.com/wiki/c/other/qsort) and sort (http://www.cppreference.com/wiki/stl/algorithm/sort) in turn to sort both the arrays. You will need to write a function for doing comparisons. The function is passed to qsort as a function pointer. The library routine qsort will “callback” your function when it needs to compare two items in the array. Use a profiler to time how long it takes to do the sort. Try a few other sort routines and time them. If you have a compiler IDE which provides profiling tools, you might try it out. Otherwise, you may want to use the very sleepy profiler (http://www.codersnotes.com/sleepy/). Run your program and then run the profiler and select your programs process to profile. If the program runs too fast because you have got a fast…

Given the array A=[3,7,-4,12;-5,9,10,2;6,13,8,11;15,5,4,1], what instruction is needed to create the following array from A, а. В-[-5,10;6,8] b. C=[3;-5;6]

1. Write a python program that combines two arrays of the same size one-in-a-row. For instance, if a=[1,2,3,4] and b=[5,6,7,8], the combined array should be [1,5,2,6,3,7,4,8].