7.b. Fast in java coding please. Thank you a. Of the sorting algorithms we covered in this course, which is the fastest? the slowest? and why for each? b. Of the sorting algorithms we covered in this course, write 1 sorting algorithm in Java of your choice.

the language is java What is recursion? What are the difference b/w loop and recursion? Use coding examples to explain your answers. Thanks!

THIS HAS TO BE IN A C++ PROGRAM NOT AN ALGORITHM. PLEASE WRITE THE PROGRAM IN C++. iM TRYING TO LEARN. THIS HAS TO BE IN A C++ PROGRAM NOT AN ALGORITHM. PLEASE WRITE THE PROGRAM IN C++. iM TRYING TO LEARN.

binary search c++ recursive

Answer 12....

See below

Instruction: Read Part 1: Chapter 1-4 of the book Automata, Computability and Complexity by Elaine Rich and answer the following Questions. 1 1. Let L1 = {all string that ends in a} and L2 = {all string that starts in b} for Σ = {a,b} Find the following language. a. L2L1 b. ¬(L2) (41) c. d. L1 L2 e. L1 UL2 2. Let L {even numbers of a's and b's}. For each of the following strings, state whether it is an element of L. a. b. ababababaa aabbaabbaa aabbcc C. d. baabaabaabbb e. E 3. Let L = {up, down, right, left}. List the element of L2 or LL in lexicographic order.

Postfix interpreter def postfix_evaluate(items): When arithmetic expressions are given in the familiar infix notation 2 + 3 * 4, we need to use parentheses to force a different evaluation order than the usual PEMDAS order determined by precedence and associativity. Writing arithmetic expressions in postfix notation (also known as Reverse Polish Notation) may look strange to us humans accustomed to the conventional infix notation, but is computationally far easier to handle, since postfix notation allows any evaluation order to be expressed unambiguously without using any parentheses at all! A postfix expression is given as a list of items that can be either individual integers or one of the strings '+','- and '/' for the four possible arithmetic operators. To evaluate a postfix expression using a simple linear loop, use a list as a stack that is initially empty. Loop through the items one by one, in order from left to right. Whenever the current item is an integer, just append it to...

Can you explain the basic workings of a counting semaphore?

1. A certain computer algorithm executes four times as many operations when it is run with an input of size n as when it is run with an input of size n – 1. Here, n> 1 is an integer. When the algorithm is run with an input of size 1, it executes 12 operations. How many operations does the algorithm execute when it is run with an input of size 5? How many operations does the algorithm execute when it is run with an input of size n?

A JAVA code following a recursive divide-and-conquer approach. Please comment on the Asymptotic running time.