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

Active Directory Authenticated Proxy Server with Squid or CNTLM -

-
I need to configure a proxy server for a local network that authenticates with Active Directory and gives me access The control list enables you to configure the domain groups within AD. I am using: Static with Squid 2.7: Windows 2008 Server R2 I have followed this guide here: The proxy does not currently ask for any Active Directory accounts, as soon as I add the following lines, it starts denying this connection: ACL localnet proxy_auth Required src 192.168. 0.0 / 24 http_access permission localname This is my squid.conf: pastebin.com/ERuKtirc I see logs and 'none' or 'direct' L It comes together TCP_DENIED message 1415014073.069 1 192.168.0.63 TCP_DENIED / 407/1904 Received / -. None / - Text / html 1415014073.07 9 4 192.168.0.63 TCP_DENIED / 407 2304 Received / - None / - Text / html 1415014073.084 2 192.168.0.63 TCPDAD / 407 1904 Received / - None - - Text / html itemprop = "text"> This proxy returns a 407 request with a browse...
Read more

java - @PluginTarget(Node.class) not registering as neo4j plugin -

-
Simple class below will not show as a plugin package com.danmacias neoneoteplugin ; Import java.util.ArrayList; Import java.util.list; Import org.neo4j.graphdb. *; Import org.neo4j.server.plugins *; Import org.neo4j.graphalgo *; // import org.neo4j.tooling.GlobalGraphOperations; @ Description (expansion of Neo4j server to achieve all nodes or relationships) Public class GetPaths expanded the server plugin {@ name ("breadth_first_paths") @ Description ("first wide travel traversal of specific node"). @plugin target (node ​​class) public shaky & lt; Path & gt; GetPaths (@ Source Node Graphidi) {ArrayList & lt; Path & gt; Path = new arreelist & lt; & Gt; (); Return path; }} curl return {"extension": {"GetAll": {"get_all_nodes": "http: // localhost: 7474 / db / ext / GetAll / graphdb / get_all_nodes "} ...}, But when I Node.class both conditions GraphDatabaseService I change with Class ,...
Read more

python - Calculate STD manually using Groupby Pandas DataFrame -

-
Image
I was trying to write a solution, which is a different and a manual for calculating a mean and STD The way. I have created a = ["Apple", "Banana", "Cherry", "Apple"] B = [3,4,7,3] C = [5,4,1,4] D = [7,8,3,7] Pd DF = PD to import pandals DataFrame (index = class (4), column = list ("ABCD")) DF ["A"] = A DF ["B"] = BDF ["C"] = C DF ["D"] = D Again, I made a list of A duplication. Then I went through the group all the time of the objects and calculated the solution. import as np l = list (set (df.A)) df.groupby ('A', As_index = False) listMean = [0] * len (df.C) ListSTD = [0] * L in the LAN (df.C) X: s = np.mean (df [df ['A'] == x] for C =.) = Z = [index for index, enumerate In the object (df ['a']. Value] x == item i for z: listMean [i] = s in: s = np.std (df [df ['a'] == X] .cvalues) z = index for index, enumerate item (df ['a']. Value) if x ==...
Read more