Evaluate the time complexity of algorithm

Assignment Help Data Structure & Algorithms
Reference no: EM13701585

Question: You need to write out using pseudo-code your algorithm.

You will be designing a non-member function that accepts as its argument one dynamic bag object (header file found in figure 4.9).  This function will return a reference to a new dynamic bag object. 

This new object will be a palindrome of the input object.  For this assignment you can assume that the class has an overloaded [ ] operator (array notation operator) that is used to access the elements of the bag. 

Also, the "pivot" point in the array will be repeated.  This means that the palindrome will be of the form 1234554321 and not 123454321 (notice that the pivot of 5 is repeated).

After you prepare your algorithm you would like to tell me what its time complexity is using Big-O notation. Can you evaluate the time complexity of this algorithm?

Reference no: EM13701585

Questions Cloud

Create application that list accounts from a dictionary : Create an application that list accounts from a Dictionary Object. Create an Account Class that contains an ID, Name, and Balance.  Disaply the account in a ListBox.
The great non-debate over international sweatshops : According to Maitland in "The Great Non-Debate over International Sweatshops," it was the Wal-Mart Corporation that broke the news (before a congressional committee) that Kathie Lee Gifford's clothing line was being produced by teenagers w..
Find the balance of the savings account : develop java application to find the balance of the savings account after the end of year - Write an application with three labeled text fields, one each for the initial amount of a savings account, the annual interest rate, and the number of years..
James builds brick walls for custom homes : James builds brick walls for custom homes. he annual sells are $300,000, and his net income is $18,000. he has assets of $100,000 invested in his business. the net profit margin for james is?
Evaluate the time complexity of algorithm : You will be designing a non-member function that accepts as its argument one dynamic bag object (header file found in figure 4.9).  This function will return a reference to a new dynamic bag object.
The principles of behavioral management : Discuss some of the ways in which the principles of behavioral management and operations management can throw light on the Steinway process. How
Calls the function readarray to read data into the array : Write a function void readArray(int arr[], int length) to read in length many values into the array arr.
Calculate monthly mortgage payments : Write a program that will calculate monthly mortgage payments on a house purchase.  The equation you'll want to use is
Implement uniform random number generator : Implement Uniform Random Number generator and Generate 1000 Random number between 0 an 10000.

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Implement an open hash table

In this programming assignment you will implement an open hash table and compare the performance of four hash functions using various prime table sizes.

  Use a search tree to find the solution

Explain how will use a search tree to find the solution.

  How to access virtualised applications through unicore

How to access virtualised applications through UNICORE

  Recursive tree algorithms

Write a recursive function to determine if a binary tree is a binary search tree.

  Determine the mean salary as well as the number of salaries

Determine the mean salary as well as the number of salaries.

  Currency conversion development

Currency Conversion Development

  Cloud computing assignment

WSDL service that receives a request for a stock market quote and returns the quote

  Design a gui and implement tic tac toe game in java

Design a GUI and implement Tic Tac Toe game in java

  Recursive implementation of euclids algorithm

Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers

  Data structures for a single algorithm

Data structures for a single algorithm

  Write the selection sort algorithm

Write the selection sort algorithm

  Design of sample and hold amplifiers for 100 msps by using n

The report is divided into four main parts. The introduction about sample, hold amplifier and design, bootstrap switch design followed by simulation results.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd