Click here to Skip to main content
13,257,276 members (48,014 online)

Proto-Bytes - Professional Profile


This member doesn't quite have enough reputation to be able to display their biography and homepage.


For more information on Reputation please see the FAQ.


Members need to achieve at least one of the given member levels in the given reputation categories in order to perform a given action. For example, to store personal files in your account area you will need to achieve Platinum level in either the Author or Authority category. The "If Owner" column means that owners of an item automatically have the privilege. The member types column lists member types who gain the privilege regardless of their reputation level.

Privileges for a group account are based on the priviliges of the administrators of that account.

ActionAuthorAuthorityDebatorEditorEnquirerOrganiserParticipantIf OwnerMember Types
Have no restrictions on voting frequencysilversilversilversilverAdmin
Bypass spam checks when posting contentsilversilversilversilversilversilversilverSitebuilder, Subeditor, Mentor, Protector, Editor, Staff, Admin
Store personal files in your account areaplatinumplatinumSitebuilder, Subeditor, Supporter, Editor, Staff
Have live hyperlinks in your profilebronzebronzebronzebronzebronzebronzesilverSubeditor, Protector, Editor, Staff, Admin
Have the ability to include a biography in your profilebronzebronzebronzebronzebronzebronzesilverSubeditor, Protector, Editor, Staff, Admin
Edit a Question in Q&AsilversilversilversilverYesSubeditor, Protector, Editor, Admin
Edit an Answer in Q&AsilversilversilversilverYesSubeditor, Protector, Editor, Admin
Delete a Question in Q&AYesSubeditor, Protector, Editor, Admin
Delete an Answer in Q&AYesSubeditor, Protector, Editor, Admin
Report an ArticlesilversilversilversilverSubeditor, Mentor, Protector, Editor, Staff, Admin
Approve/Disapprove a pending ArticlegoldgoldgoldgoldSubeditor, Mentor, Protector, Editor, Staff, Admin
Edit other members' articlesSubeditor, Protector, Editor, Admin
Create an article without requiring moderationplatinumSubeditor, Mentor, Protector, Editor, Staff, Admin
Approve/Disapprove a pending QuestionProtector, Admin
Approve/Disapprove a pending AnswerProtector, Admin
Report a forum messagesilversilverbronzeProtector, Editor, Admin
Approve/Disapprove a pending Forum MessageProtector, Admin
Create a new tagsilversilversilversilverAdmin
Modify a tagsilversilversilversilverAdmin

Actions with a green tick can be performed by this member.

NewsMillion Dollar Ideas... Pin
TheArchitectmc5-Jan-10 4:42
memberTheArchitectmc5-Jan-10 4:42 
NewsBig O Algorithm Analyzer for .NET Pin
TheArchitectmc25-Jul-09 4:51
memberTheArchitectmc25-Jul-09 4:51 
NewsBig O Algorithm Analyzer for .NET - Febuary Update Pin
TheArchitectmc28-Feb-10 14:54
memberTheArchitectmc28-Feb-10 14:54 
This project started out as a research project on proving some things about algorithm complexity in a rant I had in a thread in the section of coding horrors:

Sith Interviewing Tactics[^]

The rant was about the fact that I was forced to design an inferior algorithm to demonstrate I understood the concept of recursion. After much debate about the interview and methods of solving the problem the interviewer asked me to solve I decided that I needed to study and research 'Big O Notation' and better understand algorithm complexity. Something I have never done because I have been gifted with the ability to write code since the age of 10 and have been writing computer programs ever since. During my Carrier as a developer I was professionally mentored by Developers that created the Java Programming Language. I never felt that I wrote inferior code after this mentoring since they showed me all the best practices for writing high performance server code.

While researching the subject of Big O Notation I cam along a thread on a MSDN, a comment was made to someone asking if a tool existed that could analyse an algorithm and return the Big O Notation for the algorithm.

Original thread: C# and Big-Oh notation[^]

One developer made the comment:
'I have to admit that I don't know anything about code analysis tools. I'd doubt they could do big-Oh analysis, it requires the kind of computer you have between your ears to pull off tricks like that...'

Having had much study in the field of statistics I knew this not to be true, and that in fact it was very possible to analyze an algorithm as it runs in time take that as a control set of data, and then run it thru a statistic to see of there is a correlation to a known linear, logarithmic, exponential, or other kind of line. I responded with a few quick demonstrations showing how easy it is to look at the numbers and see this is a possible solution. After much thinking about the problem, I developed a heuristic using Persons Rio Statistic which correctly picked the right Big O Function for a given set of functions.

What I did not expect to happen what that the research would prove that a mathematical proof for an algorithm using standard Big O polynomial analysis could show that the algorithm under test did not fit the profile. It because obvious that this is due to other factors that mathematics are not looking at such as: CPU, and compiler. While the written code might be a linear solution the engineered solution may not run in liner time, due to hardware and compilers.

So I have updated the project with this conclusion, and I have also found that this is the only kind of solution that has ever been created that can accomplish this task. I believe this technology will help mathematicians and engineers to understand how to better design their algorithms and help academics understand the 'Proof in the Pudding' concept as it relates to theory and practice. While it may not add much over all value to the field of algorithm development, it should serve as both a good way to see how close an algorithm scales and how it will perform in application verses theory.

I will continue to work on this project and hope to soon have a version hosted on the CodePlex which allows for an algorithm to be entered in real time and analysed while it is being developed. I also have plans to decompile the algorithm and do a complete mathematical proof using the tried and true 'Big O Notation Polynomial' method to give the compiled, native, and live results of the analysis. I will also be adding memory profiling for discovery of the complexity of the Big O function in terms of memory growth, stack, and heap growth of the algorithm. I believe this would be a truly useful tool for mathematicians, engineers, academics, developers, architects, and quality analysis.

If you would like to join in the process of co-developing this solution, just let me know in this thread.

Cool | :cool:
GeneralXAML Graphics Series Pin
TheArchitectualizer17-Jun-09 13:45
memberTheArchitectualizer17-Jun-09 13:45 
NewsRe: XAXAML Graphics Series - Part 2 Silverlight 2.0 Desktop Art Animation Pin
TheArchitectualizer18-Jun-09 18:02
memberTheArchitectualizer18-Jun-09 18:02 
NewsRe: XAXAML Graphics Series - Part 2 Silverlight 2.0 Desktop Art Animation Pin
TheArchitectualizer25-Jun-09 11:46
memberTheArchitectualizer25-Jun-09 11:46 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

Advertise | Privacy |
Web04 | 2.8.171114.1 | Last Updated 23 Nov 2017
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid