We help IT Professionals succeed at work.

We've partnered with Certified Experts, Carl Webster and Richard Faulkner, to bring you two Citrix podcasts. Learn about 2020 trends and get answers to your biggest Citrix questions!Listen Now

x

# Quick Sort, Recursive, Binary Tree...

on
Medium Priority
665 Views
1. With a given sorted list of numbers. How to write a function that uses sequential search, and a binary search?

2. How to write a quicksort algorithm to sort unordered integer in ascending order with the following functions:
i) Find Pivot function
ii) Partition function and
iii) Quicksort function

3. How to build a binary search tree with the given key?
4. And using Recursive and Iterative function to find the minimum key in question(3)?

Thank You!
Comment
Watch Question

## View Solution Only

Commented:
Thank you too!

Joke apart, this is a homework... try to do it yourself, then you might post on specific problems you've encountered.

Good luck, julio

Commented:
These should all be covered in any basic book on algorithms or data structures.  Your question seems to cover everything from the basics ("How to write a sequential search") through to details of implementation of much more complex data structures.  If you want this much background, I would recommend reading a standard text on the subject, because answering all your questions to the same level of detail would probably take a chapter or two.

Commented:
It seems like this is a programming course assignment.  Are you trying to get us to do your homework for you?
Commented:
I beleive you can find the most of the code for your home work from this site:http://www.geocities.com/SoHo/2167/book.htmlalexxx

Not the solution you were looking for? Getting a personalized solution is easy.

##### Thanks for using Experts Exchange.

• View three pieces of content (articles, solutions, posts, and videos)
• Ask the experts questions (counted toward content limit)
• Customize your dashboard and profile