Declare and initiate a float type array of A[ ]. then create another float type array B[ ].find the unique elements of A and store them in B. Write a C program to solve the Above problem .Use pointers to traverse through these array. eg; suppose array A contains { 12.5,23.7,43.2,54.6,61.0,12.5.34.9,54.6,61.0} array B should contain {12.5,23.7,43.2,54.6,61.0,34.9} write pacchart and algorithm too

Declare and initiate a float type array of A[ ]. then create another float type array B[ ].find the unique elements of A and store them in B. Write a C program to solve the Above problem .Use pointers to traverse through these array. eg; suppose array A contains { 12.5,23.7,43.2,54.6,61.0,12.5.34.9,54.6,61.0} array B should contain {12.5,23.7,43.2,54.6,61.0,34.9} write pacchart and algorithm too

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.3: Declaring And Processing Two-dimensional Arrays

Problem 3E: (Practice) a. Write a C++ program that adds the values of all elements in the val array used in...

See similar textbooks

Similar questions

Write a code in C++ and create a two dimensional Array of size 5 X 5.(1) Inserting the following numbers.(2) Create a dynamic 2-dimensional array of size 5 X 5;(3) After inserting all numbers, display sum and average of all numbers of Array? 465 8 47 93 786 97 26 78 1327 34 77 47 5692 68 34 68 7773 69 37 78 87
Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"* 9, 15, 22, 38, 7, 8, 14 7, 8, 9, 14, 15, 22, 38 9, 8, 14, 7, 22, 15, 38 9, 8, 7, 14, 22, 15, 38 7, 9, 15, 22, 38, 14, 6 38, 22, 15, 14, 9, 8, 7
write a c++ program for the following Create a 5x5 two 2D-Dynamic array and initialize it with the number passed to the function.Your task is to do the followings;a) Write a method that will calculate the sum of all rows and return the array of mean.b) Write a method “sortColumns” that will sort the each column of 2-D array intoascending order.c) Write a method “swap_Odd_Rows” that will swap the values of odd rows.
Write a procedure for encryption by rotating each plaintext byte different number of positions. For example, in the following array that represents the encryption key, each number indicates a left rotation: key BYTE 6, 4, 1, 2, 7, 5, 2, 4, 3, 6. Pass the pointer to the text string in EDX, the array size to ECX, a pointer to the key array in ESI, and the direction value (0 or 1) in EBX. Assume that the key array size is 10. Your procedure should loop through plain text and align the key to the first 10 bytes of the message. Rotate each plain text to the left (if the value in EBX is 0) or to the right (if the value in EBX is 1) by the amount in the key array: first byte by 6, second byte by 4 etc. Then align the key to the next 10 bytes until the whole message is encrypted. Write a program that tests the procedure by calling : one time with EBX = 0 (encrypting), then with EBX = 1 (decrypting). Print out the text three times: the original, then the encrypted, then the decrypted.
Write a C program that reads a matrix of n × m numbers, transpose the matrix, then print it out using pointers. (Do not use array subscript syntax such as a[0], a[i])
(Practice) a. Write a C++ program that adds the values of all elements in the val array used in Exercise 2 and displays the total. b. Modify the program written for Exercise 3a to display the total of each row separately.
write a c++ for the following. donot copy from other sites. Solve this question without using pointers. Take a Boolean 2D array of 10X10, where each row is sorted from the user, Find the row with the maximum number of 1s.Example:Input matrix0 1 1 10 0 1 11 1 1 1 // this row has maximum 1s0 0 0 0Output: 2
Create two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the Prime numbers from the merged array A calling a function by pointer.c) Print the Array A in ascending order.You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.Example:A= [20, 30, 5, 7, 19]B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like-A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like-A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending orderA= [10, 15, 20, 30, 25] In C++ Please
Please define and initialize and array X of length 8. You need implement following and write outcomes with reasons; int X[ ] = { 1,2,3,4,5,6,7,8 }; 1.cout<< X+1; 2.cout<<&X+1; 3.cout<<2[X]; 4.cout<<&X[0]+1; 5.cout<<*(X+1); 6.cout<<*X+1; Also, practice and play with pointers using multiplication, division, subtraction and addition. You may also play with it your ways and find out reasoning. Write down those reasoning.
5. Implement the binary search function below that returns the index of the target value in an integer array. int search(int a[], int t, int l, int r); Given the binary search function in question 5 and the array a below, list all activations when calling search(a, 19, 0 15). -9 -5 -2 0 1 3 7 11 17 19 21 25 27 31 37 41 a index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Implement a C program that reorders the elements of an array of integers such that the new order is in ascending order (i.e. the first number is the smallest). You must have a main function and a swap function. The function int main() will declare an array with the values {-13,-51,-78,-91,-42,0}. This array will be passed to the swap function. The function void swap() will perform the necessary operations to reorder the elements of the array. Note that because swap is a void function, we cannot return the array back to the main function, meaning we must manipulate memory instead! After swap() is finished, have main() print the original array to show the new element order. Do not hard code your solution. If we test your code with different array values, we should still get the correct output.
iv) Write a JAVA program to merge two sorted arrays into a single sorted array. Take the sample arrays given below and print the result in the output. The time complexity of the program should be O(N+M) where N and M are the sizes of both the arrays. int []arr1 = {1, 6, 10, 14} int []arr2 = {2, 4, 5, 11, 16, 19} Print the merged array in the output.