[oasisjoel]

Hi
I would like to know how could I get or compute the efficiency of my code in visual basic?

I need to know the efficiency of my code because I am trying to compare my sorting algorithm to other existing sorting algorithm..

I try to implement my sorting algorithm using visual basic.. I would like to know how the difference of efficiency between my sorting algorithm to other sorting algorithm..


Hope you could help guys, Ty so much.... God Bless

P.S.
That is my Thesis any idea or comment about sorting algorithm implemented in visual basic would be appreciated. I also tried to implement my algorithm in turbo C.

Btw im using visual basic 6.0

[oasisjoel]

Any help will be nice ty

[AmitTheInfinity]

Well there are methods to find out the efficiency of your code. These are not technology based, you can apply these rules to codes from any language. There are two main factors in it, Time complexity and Space Complexity. Efficient algorithms keeps both of them as low as possible.

This being a very good topic, I would give you this link for more information instead of explaining it all here.

Also informative :
http://www.leda-tuto...ch02s02s03.html

[oasisjoel]

Thanks I am reading it right now

By the way I tried a software that actually try to compute the runtime of your code.. The name of the software is "VB Watch Profiler"


Here is the link if you want to try the software VB Watch Profiler

[oasisjoel]

Computing for time complexity and space complexity is quite hard.. I do not have any clue where to start.. T_T

[oasisjoel]

New D.I.C Head

*
Joined: Yesterday, 11:01 AM
Posts: 7

Hi
I would like to know how could I get or compute the efficiency of my code in visual basic?

I need to know the efficiency of my code because I am trying to compare my sorting algorithm to other existing sorting algorithm..

I try to implement my sorting algorithm using visual basic.. I would like to know how the difference of efficiency between my sorting algorithm to other sorting algorithm..


Hope you could help guys, Ty so much.... God Bless

P.S.
That is my Thesis any idea or comment about sorting algorithm implemented in visual basic would be appreciated. I also tried to implement my algorithm in turbo C. icon_up.gif

Btw im using visual basic 6.0

[Martyr2]

There are many ways you can test efficiency and they all have their contexts. So I am going to give you some terms and methodologies for testing various aspects of your code and you can just which ones you want to focus on.

1) Big O notation - A way of describing how an algorithms input size can effect the performance of a given algorithm in timing and efficiency. This is a prime tool in the measure of determining which loop or which algorithm is more effecient and has a faster "timing" that another.

2) Cyclomatic Complexity Analysis - Wow a big phrase for a relatively simple idea. Here we are measuring the number of routes, the efficiency of those routes, and the overall complexity of a given algorithm or piece of code. Typically this is through the use of graph theory or simply counting the number of branches of execution through a piece of code. Below is a site you can use to read up on it...

Cyclomatic Code Complexity Analysis

3) Pure timing - This is a simple and straight forward test where you start a timer (in the code) before you run the code you want to test and then record the time after the code you wanted to test runs. The execution time is the end time subtract the start time.

4) Unit testing tools - These are tools / software that you can use to test individual pieces of code for all sorts of things including many of the tests I describe above. These might be some tools you want to look for to help you conduct your tests and get quantifiable results for your thesis paper. This can include charts etc generated for you.

Just some things to look into for your thesis. Good luck.

[PsychoCoder]

Please don't create duplicate topics, you have this same topic in the Visual Basic Forum. Merged

[oasisjoel]

Thank you so much Martyr2... That would be a big help for me.. Sorry for the double post.. Tnx again guys

[oasisjoel]

By the way, Ill keep in touch with you guys if I need more help about my thesis.. For now I am planning to implement my sorting algorithm in Visual Basic and C.. What you think of my plan??
Any comment or suggestion guys?
And by the way my existing algorithm is Bubble sort. . .

[Ryno173]

Thava help on my topic please

[oasisjoel]

Ryno173, on 13 Sep, 2008 - 07:16 PM, said:

Thava help on my topic please

Can I ask a question, who is "Thava" and whats about your topic? Maybe I could help..