in Java

I have started the program but I am stuck. I am having trouble trying to get the output to work. I know that I have to get a for loop to get the methods to run but I have no idea how to implement it.

If anyone knows how to do this can you help?

The instructions of what is expected with the program and preferred output:

Write a Java program that times the executions of function of various run-times. Read this discussion to learn how to time individual methods.

Your program must have methods of O(log n), O(n), O(n log n), and O(n2) run times. The methods cannot be static since they will share the same n, which will be passed to a constructor.

In a test driver, create an instance of your timings object for a small value of n, say 100. Gather timings for each of your methods. Then increase n by a factor of 10 and again gather timings. Note that this can be easily done by initializing n to 100 and then, in a loop, have each iteration should a new instance and then call each function and then multiply n by 10.

None of the methods, other than the constructor, should take any arguments. All each should need is a value for n, and since this value is a data member within the object directly available to all methods..

How does your program terminate? The loop condition should become false when the slowest method consumes more than one minute.

What should your output look like? Consider the following example (with entirely fictional numbers). All numbers will be double, and we need not be concerned about the number of decimal places.

n = 100

O(log n): 0.4 seconds

O(n): 0.3 seconds

O(n log n): 0.2 seconds

O(n^2): 0.1 seconds

n = 1000

O(log n): 1.2 seconds

O(n): 3.0 seconds

O(n log n): 6.0 seconds

O(n^2): 10 seconds

n = 10000

O(log n): 3.6 seconds

O(n): 30.0 seconds

O(n log n): 180.0 seconds

O(n^2): 1000.0 seconds

Execution would continue until the slowest algorithm consumes at least one minute. Format your output as above to ease the grader's pain.

Suggestion

You may end up using large values of n. Do not use useful algorithms where the amount of memory grows with n.

Possible Hardship

Suppose your O(n2) method is running for over five minutes. Make certain that your output clearly shows the current value of n and the times of the quicker methods, Then go ahead and kill the program, and write a note explaining that you killed it and provide an estimate of how long you believe you would have had to wait to obtain the run-time.

If anyone knows how to do this can you help?

The instructions of what is expected with the program and preferred output:

Write a Java program that times the executions of function of various run-times. Read this discussion to learn how to time individual methods.

Your program must have methods of O(log n), O(n), O(n log n), and O(n2) run times. The methods cannot be static since they will share the same n, which will be passed to a constructor.

In a test driver, create an instance of your timings object for a small value of n, say 100. Gather timings for each of your methods. Then increase n by a factor of 10 and again gather timings. Note that this can be easily done by initializing n to 100 and then, in a loop, have each iteration should a new instance and then call each function and then multiply n by 10.

None of the methods, other than the constructor, should take any arguments. All each should need is a value for n, and since this value is a data member within the object directly available to all methods..

How does your program terminate? The loop condition should become false when the slowest method consumes more than one minute.

What should your output look like? Consider the following example (with entirely fictional numbers). All numbers will be double, and we need not be concerned about the number of decimal places.

n = 100

O(log n): 0.4 seconds

O(n): 0.3 seconds

O(n log n): 0.2 seconds

O(n^2): 0.1 seconds

n = 1000

O(log n): 1.2 seconds

O(n): 3.0 seconds

O(n log n): 6.0 seconds

O(n^2): 10 seconds

n = 10000

O(log n): 3.6 seconds

O(n): 30.0 seconds

O(n log n): 180.0 seconds

O(n^2): 1000.0 seconds

Execution would continue until the slowest algorithm consumes at least one minute. Format your output as above to ease the grader's pain.

Suggestion

You may end up using large values of n. Do not use useful algorithms where the amount of memory grows with n.

Possible Hardship

Suppose your O(n2) method is running for over five minutes. Make certain that your output clearly shows the current value of n and the times of the quicker methods, Then go ahead and kill the program, and write a note explaining that you killed it and provide an estimate of how long you believe you would have had to wait to obtain the run-time.

It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.8K All Categories
- 103.6K Programming Languages
- 6.4K Assembler Developer
- 401 Assembly Code Share
- 239 Getting started in assembly
- 4.6K x86 Assembly
- 1.9K Basic
- 97 Qbasic
- 39.9K C and C++
- 5.6K Beginner C/C++
- 330 C/C++ on Linux/Unix
- 450 C/C++ Windows API
- 522 C++ Builder
- 253 C++ Game Development
- 3.3K C++ MFC
- 103 C++.NET
- 404 Visual C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 334 Advanced Delphi
- 360 Delphi beginners
- 4 Haskell
- 9.7K Java
- 56 Enterprise JavaBeans
- 1.3K Java Beginners
- 304 Java Server Pages
- 4.1K Pascal
- 1.3K Perl
- 11 Perl 6
- 2K PHP
- 546 Python
- 37 Ruby
- 4.4K VB.NET
- 258 Advanced VB.Net
- 1.6K VBA
- 20.8K Visual Basic
- 767 Access databases and VB
- 831 Advance Visual Basic
- 1.2K Beginner VB
- 2.6K Game programming
- 315 Console programming
- 90 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 279 3D Graphics
- 129 DirectX
- 125 OpenGL
- 740 Computer Hardware
- 9 Cooling & Overclocking
- 3.4K Database & SQL
- 1.1K Access
- 91 ADO Programming
- 288 MySQL
- 358 Oracle
- 440 SQL-Server
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 25 DirectSound
- 257 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 198 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 603 Jobs Wanted
- 209 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 22 .NET WEB-Services
- 129 .NET WinForms
- 14 .NET XML
- 50 ADO.NET
- 142 C# & VB.NET School Support
- 3.4K Miscellaneous
- 4 Join the Team
- 354 Comments on this site
- 69 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 621 Off topic board
- 200 Mobile & Wireless
- 72 Android
- 126 Palm Pilot
- 338 Multimedia
- 154 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 27 Cloud Computing
- 1 Witsbits Go Cloud
- 53 FreeBSD
- 1.7K LINUX programming
- 1 Awk scripting
- 332 Linux Support
- 0 Sed scripting
- 370 MS-DOS
- 0 Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 177 COM/DCOM
- 61 Networking And Security
- 17 Windows 2003 Server
- 6 Windows Vista
- 176 Windows XP
- 940 Software Development
- 417 Algorithms
- 68 Object Orientation
- 24 RUP & UML
- 91 Project Management
- 95 Quality & Testing
- 268 Security
- 63 Evil Scripting
- 81 Hacking
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 4 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 131 Mobile Internet & Messaging
- 211 Wireless development
- 2.2K JavaScript
- 37 JQuery
- 304 WEB Servers
- 153 Apache
- 79 IIS
- 150 WEB-Services / SOAP