# algorithm

Q1)
Show, by applying the limit test, that each of the following is true.
a) The functions f(n)= n(n-1)/2 and g(n)= n^2 grow asymptotically at equal rate.
b) The functions f(n)=log n grow asymptotically at slower rate than g(n)=n.

Q2)
Show that log (n!) = Θ (nlog n);

Don't use plagiarized sources. Get Your Custom Essay on
algorithm
From as low as \$9/Page

Q3)
Design an algorithm that uses comparisons to select the largest and the
second largest of n elements. Find the time complexity of your algroithm
(expressed using the big-O notation).

Q4)
Given an a binary array or list of n elements, where each element is either
a 0 or 1, we would like to arrange the elements so that all of those that
are equal to 0’s appear first followed by all the elements that are equal
to 1’s.

a) Write an algroithm or a function that uses comparisons to arrange the
elements as given above. Do not use any extra arrays in your algorithm.

b) Find the time, T(n), needed by your algorithm in the worst-case and
then express it using the big-O notation.

c) Find the time, T(n), needed by your algorithm in the best-case and
then express it using the big-Ω notation.

d) Find the time, T(n), needed by your algorithm in the average-case
and express it using the big-Θ notation.

## How to place an order?

Take a few steps to place an order on our site:

• Fill out the form and state the deadline.
• Calculate the price of your order and pay for it with your credit card.
• When the order is placed, we select a suitable writer to complete it based on your requirements.
• Stay in contact with the writer and discuss vital details of research.
• Download a preview of the research paper. Satisfied with the outcome? Press “Approve.”

### Feel secure when using our service

It's important for every customer to feel safe. Thus, at The Homework Writings, we take care of your security.

Financial security You can safely pay for your order using secure payment systems.
Personal security Any personal information about our customers is private. No other person can get access to it.
Academic security To deliver no-plagiarism samples, we use a specially-designed software to check every finished paper.
Web security This website is protected from illegal breaks. We constantly update our privacy management.

Get assistance with placing your order. Clarify any questions about our services. Contact our support team. They are available 24\7.

Still thinking about where to hire experienced authors and how to boost your grades? Place your order on our website and get help with any paper you need. We’ll meet your expectations.