Share
Explore BrainMass

Sorting

Sorting Algorithm in Java

Please assist so that I can complete the following: You will create a program that runs a sorting algorithm on a set of randomized values. Your program should run the algorithm several times, to get the average time for each sorting technique. STEPS 1. Write a program using C++ or Java that will take in randomized value

Big-O, Big-Omega, Big-Theta

Let f, g, h, and k be the following functions: f(x) = 3*(x^2) + 4*ln(x) + 9 g(x) = x^2 h(x) = x^5 k(x) = 1 [the constant function "1"] Throughout the statement and solution to this problem, a caret ("^") denotes that the number immediately following it is an exponent. -------------------------------------------

Data structures C++ -- Quick sort Algorithm

Use the quicksort algorithm to sort vector v. During each pass, list all exchanges of a pair of elements in the lower and upper sublist. List the ordering of the elements after each pass. int arr[] = {790, 175, 284, 581, 374, 799, 852, 685, 486, 333}; int arrSize = sizeof(arr)/sizeof(int); vector<int>v(arr, arr+arrSize);

Creating Pseudocodes and Flow Charts

How do you write pseudocode and a flow chart that would let you put in up to 50 student names and 4 grades for each? The names need to be sorted alphabetically and the grades averaged and sorted from highest to lowest.

Effects of Pronation on Knee Injury Risk

Please read this articles both are critical for the discussion on the topic on Effects of Pronation on Knee Injury Risk. Read the articles from: a) Powers 2003 b) Shultz 2006 In a 1-page document,(essay type) describe how the inability to control forefoot pronation during functional tasks may increase injury risk to th

iHaul Sales Force Facts and Figures

Looking for help in completing this problem. It has to be done in Microsoft Excel 2007. Thank you Instructions - Open Excel and start with a blank spreadsheet. In cell A10 type in the words "iHaul Sales Force Facts and Figures" - do not use quotes, do use font size 16, and make the text bold. Merge and center these word

Create a Database Diagram

Assume that FiredUp has created a database with the following tables: CUSTOMER (CustomerSK, Name, Phone, EmailAddress) STOVE (SerialNumber, Type, Version, DateOfManufacture) REGISTRATION (CustomerSK, SerialNumber, Date) STOVE_REPAIR (RepairInvoiceNumber, SerialNumber, Date, Description, TotalCost, TotalPaid, CustomerSK) A

Analyzing Basic Algorithms

Given a list L[0:n - 1], one way of maintaining a sorted order of L is to use an auxiliary array Link[0:n - 1]. The array Link[0:n - 1] serves as a linked list determining the next highest element in L, so the elements of L can be given in nondecreasing order by L[Start], L[Link[Start]], L[Link[Link[Start]]], and so forth. The

Sorting Algorithms Comparison

We have considered the following sorting algorithms in this book: Heap, Insertion, Merge, Quicksort, Radix, Selection For each sort, give the average and worst case running time and the space requirements, and make some additional comments about the efficiency of the algorithm. The additional comments may specify how proba

Discuss the design stage of a hypothetical work-related project

Describe the alternatives that were considered during the design stage of the project. What were the considerations in choosing the best alternative strategy? Outline the design tools and techniques used for the project. You may draw any supporting structure charts and process design to support your description and import into t

Sorting Algorithms

Sort the following array using insertion sort manually: 7-4-1-6-2-3-8-5. Show the results after each pass in a table. Explain, briefly, what happens in each row. Sort the same array using quick sort manually. Select the pivot from the midpoint in the list. Indicate all exchanges that move a corresponding pair of elements in the

Sorting Algorithms C++

Please help with the following problem. Prompt the user for the name and age of a group of people. The group's size is unknown initially, so the program must keep asking the user if they want to enter more data. When the user finishes, the program should print each person in order from the youngest to the oldest, that is, th

Data Structures C++

Describe the worst case scenario for quick sort algorithm. Any ideas to improve the worst case? Comment on the improvement in running time vs. increase in code complexity.

Design an algorithm problem

You should post the "best possible" responses to the question. Remember that the main purpose of algorithm questions is to come up with the best possible algorithms through discussion. It is ok to write your responses using pseudocode, and there is no need to code & test using C++. 1. Design an algorithm for finding two clos

Execution of Binary Search Algorithm

See the attached file. Given algorithm looks for a value in a nondecreasing sequence and returns the index of the value if it is found or 0 if it is not found. Input: A sequence si, ...... ,sj (j >= i >= 1) sorted in nondecreasing order, a value key, i, and j Output: The output is an index k for which sk = key, or if key i

Project Management Questions

- If you inherit a project which has all sorts of problems in it, what are the steps you'll take to in order to start working on it? - If a project team handles operations side of tasks as well as project development side of tasks, how would you, as a project manager balance or utilize project resources for optimal use? -

Excel Functions in Worksheet

I need help with the following worksheets: Internet data 2 and Weekend Overtime Name: WallachShelley II I I IIIIIIIII Make this ... Look like this ... Marcos, Imelda Imelda Marcos Wallach, Shelley Shelley Wallach Wallach Shelley Ho, Don Don Ho Ho Don

Data Connected Applications

CpCreate an MS Access database called "Members.mdb." Add a table called "tblScores" with the following columns. MemberID - AutoNumber FirstName - Text LastName - Text Add at least 10 rows to this table. Create an ASP.NET project with Visual Studio.NET that contains two aspx forms. The first form uses the Login con

Sorting a List and Displaying Mean

Simple Array Process ? Input a list of employee names and salaries, and determine the mean (average) salary as well as the number of salaries above and below the mean. Use the top-down modular approach and pseudocode to design a suitable program to solve it. Please generate only the pseudocode (a simple one) - No charting

Write interactive program that uses scanf()

Need to read in 7 strings input by the user.It need to print the seven strings as list than sort them alfabeticaly and print new list.use strcmp() for sorting. Also use #define N_STRINGS 7

Pick all correct answers

Question Pick all correct answers: If f(x) = 3x^2 + 4ln(x) + 9, then f(x) is:... a. Big-Theta of g(x) = x^2 b. Big-Omega of g(x) = 1 c. An unimpressive time-cost function for a sorting algorithm d. Big-O of x^5 e. Big-Omega of x^5

Indexes, data types, filegroups, and transaction logs

Discuss your thoughts on the effects of indexes, data types, filegroups, and transaction logs on space considerations. Which of those database constructs do you feel are most important to manage when it comes to database size considerations? Why? What factors would you focus on when determining the actual size of these database

Scheduling Activities

Your friend is working as a camp counselor at a camp. He needs to organize activities for the kids. One of his plans is the following marathon: each contestant must swim 20 laps of a pool, then bike 10 miles, and then run 3 miles. The plan is to send the contestants out in a staggered fashion via the following rule: the contesta

Median Finding Algorithm for Joint Databases

You are interested in analyzing some hard to obtain data from two separate databases. Each database contains n numerical values - so there are 2n values total- and you may assume that no two values are the same. You'd like to determine the median of this set of 2n values, which we will define here to be the nth smallest value.

Topological Sorting

An algorithm for computing a topological ordering of a DAG (Directed Acyclic Graph) repeatedly finds a node with no incoming edges and deletes it. This will eventually produce a topological ordering, provided that the input graph really is a DAG. But suppose that we're given an arbitrary graph that may or may not be a DAG. Ex

Minimum amount of Base Stations

Let's consider a long, quiet country road with houses scattered very sparsely along it. (Picture the road as a long line segment with an eastern endpoint and a western endpoint.) Further lets suppose that despite the country setting, the residents of all these houses are avid cell phone users. You want to place cell phone bas