Implement a sorting algorithm of your choice in Java and What are some factors to consider when determining which sorting algorithm would be best to utilize? In your answer, specifically think of and give a real-life scenario where: A given sorting algorithm is used One algorithm outperforms the other Please and Thank you

Implement the problem below in Python using mpi4py. Submit the code of your program and a brief report. The report should describe the design of your program, and demonstrate the results of running your program. n-body solver. Implement a parallel n-body solver with n = 10 particles. You may randomly generate the masses, initial velocities, and initial positions of all particles at the beginning. Compute the positions of all particles after 1 second. Compare the results by using 0.1s, 0.01s, and 0.001s as the time in each timestep, respectively.

Please type thank you! Tasks: 1. Write a python program that implements the estimation of Pi through a Monte Calo simulation. 1) How many iterations do you need to run? make a case for when it is a good approximation of Pi. 2) Suggest a method that would accelerate the approximation of Pi. You may either suggest a method that would accelerate the approximation of Pi than the method you described in b, or you may describe two methods and explain which one can accelerate the approximation of Pi than the other one.

What are some of the benefits of using an ADT bag in Java? Provide an example that illustrates when using a bag would be useful. In your answer, specifically think of and give a real-life scenario where: The Bag ADT can be useful Using Bag ADT is better than the alternatives Please and thank you

This is not a java code. Please, I need an expert to solve the problem using java coding and show step-by-step stages.

I want solution with steps

Write a FULL Java procedural program for one human player to play a "Higher or Lower" card game. In this game, each card has a value from 1..10 inclusive. There are 4 of each value in the deck, i.e., 40 cards in total. Cards are not replaced in the deck once drawn, i.e., no more than 4 of each value will be drawn. The program starts by asking the player for a target score. The game proceeds in a series of rounds with the program repeatedly drawing and showing a card from the deck to the player one at a time. Each time, it asks the player to enter "h" (higher) or "l" (lower) to guess whether the next card drawn will be higher or lower in value. The player gains a point if they guess correctly. The game continues until the player guesses incorrectly or the target score is reached. When the game ends, it prints either a "You win!" or a "Nice try, you scored ..." message as illustrated below. The image provided shows two examples of the required program behaviour: (bold is keyboard input...

The birthday paradox says that the probability that two people in a room will have the same birthday is more than half, provided n, the number of people in the room, is more than 23. This property is not really a paradox, but many people find it surprising. Design a Java program that can test this paradox by a series of experiments on randomly generated birthdays, which test this paradox for n = 5, 10, 15, 20, ..., 100.

The first image is the main question, the second image is the instructions for the program. The program has to be written in Java.