Using C not(C++ or C#) without the use of strings and arrays, I need help in coding this small function as part of practice. We cant use any other library (like math.h stab.h etc) apart from stdio.h). So the program that I am trying to code requires me to construct a vertical histogram for the respective numbers. Again since this is a practice I want it to be without arrays and strings and in the form of function. Attached below are the desired output that I want. The code would go something like this : // @param num the number which will be used to display the histogram// void histogram(int num) { }

Write a c++ code that compare the times to traverse a list (containing a large number of elements) implemented in an array, in a simple linked list, and in an unrolled linked list. In this experiment, you need to generate a large list, store it in each representation, and then measure the time to traverse the list in each representation. For the array, this is almost straightforward: Fill the array and then do a sequential scan. Here is the thing to watch for: When you fill the array, it all gets read into cache. So, somehow you need to ensure that almost all of the array is NOT in cache before you do your traversal. One thing you can do is make your array big enough that most of it will not fit in cache at once. You need to make sure that the node capacity is not too small, or it will behave too much like a simple linked list.

For this assignment, you must implement the ElGamal Public-Key Encryption scheme with any programming language that you are comfortable with. The recommendation is to use C/C++ or Java. You can accomplish this assignment individually or by forming a team of 2 students. Alternatively, you can work with your team members of the previous assignment. Your program should get the "key size" from the user in terms of number of bits (for instance, 64, 128, etc). Based on the size, use Fermat or Miller-Rabin primality test algorithm to define your large prime number. You can use the existing programming packages to find a generator of your finite field. Your program should then initialize a pair of key, i.e., private and public keys. For the computations, utilize the Square-and Multiply algorithm. In fact, your program should get a plaintext from the user to perform encryption (generating the ciphertext from the plaintext) and decryption (generating the original plaintext from the ciphertext)....

Using C++. Assume your development team is tasked with writing a pathfinder ( solution finder ) or the childhood game of 8 sliding tiles game. Your task is to determine whether or not an initial board configuration is or is not solvable. Your algorithm should do this by counting inversions. If the number of inversions is even, then the board is solvable. If the number of inversions is odd, then the board is not solvable (there is NO sequence of moves that will transition from the initial board to the goal board).

I do not know how to do this problem from my Computer Science ZyBooks Chapter 6 assignment. I have attatched an image of the problem, and I need to write the code in Python. I am not sure how to define the functions correctly or how to take a list as a parameter and return a boolean, so any help would be greatly appreciated! Thank you!

IN HASKELL PROGRAMMING LANGUAGE PLEASE In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but...

please answer with proper explanation and step by step solution. i need code in c++ Using the sample BUBBLESORT program given in class do the following: Print out the original unsorted data Print out the data sorted (ascending) Print out the data sorted (descending) Print out the Maximum and Minimum and the range Print out the median Print out the mode Print out any data having a frequency greater than 3 Print out the standard deviation Sample output: Unsorted List: 9 8 1 6 12 3 5 4 3 6 1 3 6 6 Sorted List: 1 1 3 3 3 4 5 6 6 6 6 8 9 12 (ascending) Sorted List: 12 9 8 6 6 6 6 5 4 3 3 3 1 1 Maximum: 12 Minimum: 1 Range: 11 Median: 5.5 Mode: 6 Frequency: 6 occurs 4 times 3 occurs 3 times Do NOT use files...I should be able to enter UP TO 15 values and have the program work. BE sure that your program covers ALL cases of the median and mode as discussed in class!!!!

Write a program in C that, given two points on a two-dimensional graph, outputs a message (string) if the line that connects them is horizontal or vertical, or if the slope is positive or negative.What would you modify or adjust in your code if we move from a 2D cartesian system to a 3D dimensional cartesian system?You need to take into consideration if the system is 3D and therefore you need to ask the user to insert X, Y , and Z.

Using C++ Using your own creativity, make a set of function templates that have these features: This function must return a value. A function template with 1 template parameter, T. And, any other parameters you want. and then another function template but this time with 2 template parameters, T1 and T2. And, any other parameters you want.

Do it in linear time complexity and do not use any functions of the string class in C++ like find(), erase().