Jump to content
  • Advertisement


  • Content Count

  • Joined

  • Last visited

Community Reputation

100 Neutral

About cpp_boy

  • Rank
  1. Hello. I need to use datagrid object in asp3.0 . I cannot find any guide for this process. Are there any guides or maybe you can instruct me ? Thanks in advance.
  2. cpp_boy

    n*log(n) VS log(n!)

    Hello there. After checking it out with the proffessor, I'm sure now that my algo is innovative. It seems that the array implementation is not as good as I though it will be. best case O(n) , worst case O(n^2). The algo is capable to give performence of O(log n!) in its worst case, O(n) in its best case, but this implementation requires special kind of data structure(still working on this one). First publication of the algorithm will be in one of the science journals (I think in few month, I'm still working on the emproved version). I cannot reveal my algo before its publication (that is what my proffessor suggested me to do). Thank for the help of the good guys (and for the criticism of the bad guys). Yours, cpp_boy.
  3. cpp_boy

    n*log(n) VS log(n!)

    Wikipedia-Sorting Algorithms I have compared with every algo out there . My algo is complitelly different. But, I see that my algo performence very close to Smoothsort and Patience sorting.
  4. cpp_boy

    n*log(n) VS log(n!)

    Guys, I'm still here. I'll visit university in thursday, and then i'll inform you. Meanwhile, I cant show my algo even to my closest friends. If my algo calculations are incorrect, or this algo allready exists,I preffer that one person (my proffessor) will laugh at me, and not all the community. I hope to come back here soon with good news ;)
  5. cpp_boy

    n*log(n) VS log(n!)

    I know perfectly well what is O, Theta, and Omega notations. But still. The average of my algorithm is somewhere between n And log(n!) . And this is realy fast. It beats merge and quick in any possible case !!!
  6. cpp_boy

    n*log(n) VS log(n!)

    Some here said that O(log n!) is approximetaly O(nlogn - n) For ANY input, (nlogn - n) is faster than (nlogn). In its best case, my algorithm takes O(n). Worst case is O(log n!) . So, in any case, I didnt heard about anything faster than this one. One bad thing about my algorithm, is that it requeres a kind of linked list, and this one takes a little extra memory. Unfortunelly, at this moment, I cannot post my algorithm here. First of all, I want to show it to my university professor.
  7. cpp_boy

    n*log(n) VS log(n!)

    Quote:Original post by KulSeran if you had read the link. ln(n!) aprox = nln(n) - n so, yes, as N gets bigger, your's seems faster in # of steps. BUT, O notation drops the constants that do not affect the shape of the curve. nlog(n) - n is O(nlogn) n^2 + n + 1 is still O(n^2) 15*nln(n) + n^n is still O(n^n) the point of O notation is to indicate the reletive growth rates of functions, not the exact growth rate. O(log(n!)) is therefore the same speed as O(nlog(n)) I'm know very well what O notation means. But, in real life, 1 hour and 2 hours are BIG difference. Therefore: logn + logn + ... + logn (n times) = nlogn log1 + log2 + ... + logn (n times) = log(n!) doesnt take same time in real life. Take my algorithm, take quicksort, let them sort something. I dont care about O notation. If my alorithm takes 5 minutes less (for array sized 10^6 for example), I'll throw quick sort to the garbage!!! One week and two weeks are the same O. Weach one you'll take ???
  8. cpp_boy

    n*log(n) VS log(n!)

    Quote:Original post by Sneftel Heh. Sorry to burst your bubble, but by Stirling's approximation, O(n log n) = O(log n!). (This isn't surprising, since it has been proven that sorting based only on an ordering cannot be done in less than O(n log n) average.) If you like, post your algorithm and we'll try to figure out what it's called. (There are an immense amount of sorting algorithms; it's quite likely that yours is homomorphic to one which already exists.) Yes, but still, if you build graphs (in MS Excel for example) for those two, log(n!) is MUCH faster than nlog(n). For example, for array sized 10000 the difference in number of operations requered is approximately 15,000 operations!!! nlogn = logn + logn + ... + logn (n times) log(n!) = log1 + log2 + ... + logn (n times) As you can see, its much faster. Am I wrong ???
  9. cpp_boy

    n*log(n) VS log(n!)

    Hello. I have invented a new sorting algorithm wich takes O(log n!) Is it much faster then O(nlogn). Maybe someone can draw those two functions in the same system for n~(1,10000) and post here the comparison picture.
  10. Quote:Original post by Machaira The problem is that you haven't added event handlers for the scrollbars. They don't automatically do anything by themselves. An alternative - drop a Panel on the form and set it's AutoScroll property to True. Add your controls to the Panel instead of the form. I still have nothing. I added few buttons and HScrollBar to panel. I also did autoscroll to panel. When I'm moving panel's scroll, buttons on panel are not moving :-( What to do this is what I did: 1. Put panel with autoscroll = true 2. Add few buttons to panel 3. vScrollBar1 = new VScrollBar(); vScrollBar1.Minimum = 0; vScrollBar1.Maximum = 1000; vScrollBar1.Dock = Dockstyle.Right; //Add the scroll bar to the panel. this.panel1.Controls.Add(vScrollBar1);
  11. Hello developers. I'm trying to figure out how to connect ScrollBar. I'm painting something on the Form. This something is much bigger than a Form, thus I need a scrolling. I'm doing something like this(according to MSDN): hScrollBar1 = new HScrollBar(); hScrollBar1.Minimum = 0; hScrollBar1.Maximum = 1000; hScrollBar1.Dock = DockStyle.Top; // Add the scroll bar to the form. Controls.Add(hScrollBar1); I cannot scroll the Form. I see my scrollbar, I can move it, but it has no influence on my form. Maybe Form is not scrollable, and I have to paint on some scrollable object ? Thanks in advance
  12. Hello. I want to change the center (0,0) from upper left corner of the form to something else, and I also want to reverse the direction of the xy axes. How can I do that ? (I'm using C#.net) THANX
  13. Hello. I have table with 2 columns, non of them is a key. I need query that will NOT select duplicated rows, only one occurrence of each row kind will appear after this select. Thanks in advance.
  14. Quote:Original post by u235 The txtBoxGenre.Text or txtBoxGenre.Value property will be whatever text is in the textbox. Hope that helps. -AJ But from C# file I cannot do "this.txtBoxGenre". C# file cannot directly access to <asp:xxx...> components that belong to aspx file.The solution is that I have to somehow do (TextBox) casting to EventArgs variable. Someone told me that this must be done from within DataGrid_CommandItem function or something like that. Does this sound familiar to you ?
  15. Hello. In my aspx file, I have : <FooterTemplate> <asp:TextBox Runat="server" ID="txtBoxGenre" TextMode='<%# DataBinder.Eval(Container, "DataItem.genre") %>'> </asp:TextBox> </FooterTemplate> How can I get text from this text box from C# file that is a background code of this aspx file. Thanks in advance
  • Advertisement

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!