Is there a sorting algorithm available which has time complexity of O(N)? -

-

अधिकांश सॉर्टिंग एल्गोरिदम में O (N N) या O (N logN ) परिणाम प्राप्त करने के लिए। हालांकि, वहाँ एल्गोरिदम हैं जो इनपुट के विशिष्ट सेट के लिए ओ (एन) की जटिलता है। मुझे यह जानना चाहिए कि यदि कोई सॉर्टिंग एल्गोरिदम उपलब्ध है जो सभी मामलों में ओ (एन) की जटिलता है।

यदि आप केवल तुलना कर सकते हैं (जांचें कि दो आइटम हैं तो ;,>, ==) मान सॉर्ट किया जा रहा है, तो आप ओ (एन लॉग (एन)) से बेहतर नहीं कर सकते यह एल्गोरिदम पर कुछ सिद्ध सीमाओं में से एक है। यह सबूत बहुत जटिल नहीं है (विवरण के लिए विकिपीडिया पर तुलना सॉर्ट देखें), लेकिन यहां दोबारा नहीं करना काफी है।

यदि आप तुलनात्मक रूप से अन्य चीजों को अधिक लचीलेपन के साथ कर सकते हैं, यदि आपके पास संख्याएं हैं, तो आप बाल्टी सॉर्ट (एक प्रकार का रेडिक्स सॉर्ट) जांचते हैं, यह ओ (एन) सॉर्टिंग संभव बनाता है।


Comments

Post a Comment

Popular posts from this blog

java - Can't add JTree to JPanel of a JInternalFrame -

-
Image
There are two panels in my JInternalframe. I want to add TopPanel to Jtree to nominate another. But I can not add Jaitari to the top of the panel. Please help me in this piece of code: DefaultMutableTreeNode root = new DefaultMutableTreeNode ("deck"); DefaultMutableTreeNode Item Clubs = New DefaultMutableTreeNode ("Club"); AddAllCard (itemClubs); Root.add (itemClubs); DefaultMutableTreeNode item = New DefaultMutableTreeNode ("Diamonds"); AddAllCard (itemDiamonds); Root.add (itemDiamonds); DefaultMutableTreeNode Itemspads = New DefaultMutableTreeNode ("Spades"); AddAllCard (itemSpades); Root.add (itemSpades); DefaultMutableTreeNode item increases = new DefaultMutableTreeNode ("heart"); AddAllCard (itemHearts); Root.add (itemHearts); Default Trimodel Tree Model = New DefaultTreeModel (Route); Tree = new jetty (tree modal); ScrollPane = new JScrollPane (tree); // scrollPane.setViewportView (tree); . ScrollPane.getViewport () add (tr...
Read more

c++ - Qt-how to convert a QByteArray to struct -

-
I need to convert a QByteArray into a structure. I have such a structure: struct mavlink_attitude_t {/// & lt; Summary & gt; Timestamp (millisecond from system boot) & lt; / Summary & gt; Quint 32 Time_boot_ms; /// & lt; Summary & gt; Roll angle (rad, -pi .. + pi) & lt; / Summary & gt; Float roll; /// & lt; Summary & gt; Pitch angle (red, -p + + pi) & lt; / Summary & gt; Boat pitch; /// & lt; Summary & gt; Angle of O (Red, -P. + Pi) & lt; / Summary & gt; Float yao; /// & lt; Summary & gt; Angular Speed ​​Roll (Rod / S) & lt; / Summary & gt; Float rollspeed; /// & lt; Summary & gt; Pitch angular momentum (rad / s) & lt; / Summary & gt; Float pitchspid; /// & lt; Summary & gt; Yoga's angular momentum (RD / S) & lt; / Summary & gt; Float Yspeed; }; And I come from a Quetbeat Serial Port. I was already using the union but I think it can not be used for QByteArray, i...
Read more

c# - How to know the number of Threads created and limit the Tasks accordingly -

-
It is very clear that with task as async / await Instead of calling the asynchronous call threads , my question is: Is there a way to monitor threads while completing these tasks? This is because I can decide an optimal number of times for the thread that the thread does not eat too many CPU cycles at the same time (the CPU is intensive to handle the work). We take an example below (output is also mentioned) Although the program is completed in 5 seconds, but it has two threads (id = 1,4 ) if I increase the number of 6 instead of 2, then it creates 4 threads I know that this is the CLR thread OS thread (which is 4 in my machine Are), but I would like to know how they are mapped O (with actions) and use the same CPU. Is there any way to get it? Test code Fixed zero main (string [] args) {RunTasksWithDelays (). ); } Static async Task Run Task with Dislay () {Stopwatch S = Stopwatch. Startup (); Console.light line ("thread id =" + thread.content.trade.manag...
Read more