[algogeeks] Re: Merge two BST in O(n) time with O(1)
@Varun S V Appending the nodes to the first subtree will result in O(mlgn) as each node of second BST will have to go through log n level of the first BST On Jan 29, 12:37 am, Varun S V wrote: > Delete the nodes in the second BST in postorder. As and when you delete this > node, insert it into the first BST. > > > > On Thu, Jan 28, 2010 at 9:35 PM, Bijlwan wrote: > > hey nirmal . i don't get that when you merge the two linked list , > > how do you get the BST? > > making the BST would itself be a O(nlogn) process? > > > On Jan 28, 5:03 am, Nirmal wrote: > > > Given two binary search trees, how to merge them in O(n) time and O(1) > > > space? > > > > It can be done using O(n) space as below, > > > > 1. covert BST #1 into linked list or sorted array > > > 2. covert BST #2 into linked list or sorted array > > > 3. merge them... > > > > but how to do this in place? > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algoge...@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com > > . > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en.- Hide quoted text - > > - Show quoted text - -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Algorithm intensive Please solve
@sachin : the problem is bit more complex , consider N be 2 , and coordinates be (-2,0) (0,0) (1,0) (3,0). your solution( min value=1+5=6) wont give the right answer(2+2=4). On Sat, Feb 13, 2010 at 6:07 PM, sachin wrote: > We can make a spanning tree for these 2N points and then find the > minimum spanning tree > keeping in mind that a node can only be considered in one edge and not > more than once. > This will give you the minimum total sum of all the pairs. > You can use kruskal's min spanning tree algorithm to find the minimum > spanning tree because > kruskal's method works by finding the least cost edges & then > proceeding towards the max cost edges. > I hope it solves your problem. > > Regards, > Sachin > > > On Feb 12, 9:20 am, GentLeBoY wrote: > > given 2N points in a plane. Pair up to obtain N distinct pairs such > > that total sum of paired distances is minimum. > > N can be atmost 50. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Vikrant Singh -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Algorithm intensive Please solve
We can make a spanning tree for these 2N points and then find the minimum spanning tree keeping in mind that a node can only be considered in one edge and not more than once. This will give you the minimum total sum of all the pairs. You can use kruskal's min spanning tree algorithm to find the minimum spanning tree because kruskal's method works by finding the least cost edges & then proceeding towards the max cost edges. I hope it solves your problem. Regards, Sachin On Feb 12, 9:20 am, GentLeBoY wrote: > given 2N points in a plane. Pair up to obtain N distinct pairs such > that total sum of paired distances is minimum. > N can be atmost 50. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Algorithm intensive Please solve
I am thinkin like.. make a completely connected graph.. (connect all 2N points to each other)... then delete connections starting with ones with max distance between them... this should give the desired result On Feb 11, 11:20 pm, GentLeBoY wrote: > given 2N points in a plane. Pair up to obtain N distinct pairs such > that total sum of paired distances is minimum. > N can be atmost 50. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Call for Papers: The 2010 International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government (EEE'10), USA, July 2010
It would be greatly appreciated if this announcement could be shared with individuals whose research interests include e-learning, e-business, enterprise information systems, and e-government. Thanks. --- CALL FOR PAPERS EEE'10 The 2010 International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government Date and Location: July 12-15, 2010, Las Vegas, USA You are invited to submit a full paper for consideration. All accepted papers will be published in the EEE conference proceedings (in printed book form; later, the proceedings will also be accessible online). SCOPE: Topics of interest include, but are not limited to, the following: O e-Learning: - e-Learning design and methodologies - e-Learning portals - Instructional design methodologies - Audio and video technologies for e-Learning - Authoring tools - e-Learning technologies and tools - Social impact and cultural issues in e-Learning - Content management and development - Policy issues in e-Learning - On-demand e-Learning - e-Learning standards - Assessment methodologies - Knowledge management - Virtual learning environments - AI and e-Learning - On-line education (all levels: elementary, secondary, ...) - Open-source e-Learning platforms - Training and evaluation strategies - e-Universities - Case studies and emerging applications O e-Business: - e-Business systems integration and standardization - Electronic negotiation systems and protocols - Internet payment systems - e-Procurement methods - Techniques for B2B e-Commerce - Global e-Commerce and e-Business - e-Business models and architectures - Service-oriented e-Commerce - Trust, security, and privacy in e-Commerce and e-Business - Intelligence in e-Commerce - Secure Databases and e-Commerce applications - Business-oriented and consumer-oriented e-Commerce - Development of e-Business and applications - e-Business in developing countries - Novel marketing strategies on the web - Organizational and management issues - Supply chain management - e-Retailing and web design - Applications of new technologies to e-Business - Middleware technologies to support e-business - Case studies and applications O Enterprise Information Systems: - Strategic decision support systems - Organizational semiotics and semiotics in computing - Datacenters, data warehouses and technologies - Knowledge management - Enterprise resource planning and e-Business - middleware integration - Intranet and extranet business applications - Databases and information systems integration - Intelligent agents - Enterprise-wide client-server architectures - Information systems analysis and specification - Ontology engineering - CASE tools for system development - B2B and B2C applications - Business processes re-engineering - Market-spaces: market portals, hubs, auctions, ... - Semantic web technologies and Cloud computing - Web interfaces and usability - Human factors and e-Learning - Case studies and applications O e-Government: - e-Democracy and e-Voting - e-Government - Use of e-Government methodologies to prevent corruption - Legal aspects of e-Government - Risk management - Methods and tools for e-Government - Policies and strategies - Designing web services for e-Government - Trust and security in e-Government - Enterprise architecture for e-Government - Interoperability frameworks in e-Government - Inter-administration and G2G issues - Public and private partnership - Teaching e-Government - Case studies USEFUL WEB LINKS: To see the DBLP list of accepted papers in the last offering of EEE, go to http://www.informatik.uni-trier.de/~ley/db/conf/csreaEEE/csreaEEE2009.html The main web site of EEE'10 is accessible at http://www.worldacademyofscience.org/worldcomp10/ws/conferences/eee10 CONFIRMED ACADEMIC & TECHNICAL CO-SPONSORS (a partial list): The Berkeley Initiative in Soft Computing (BISC), University of California, Berkeley, USA; Collaboratory for Advanced Computing and Simulations (CACS), University of Southern California, USA; Intelligent Data Exploration & Analysis Lab., University of Texas at Austin, Texas, USA; Harvard Statistics Department Genomics & Bioinformatics Lab., Harvard University, Massachusetts, USA; BioMedical Informatics & Bio-Imaging Lab., Georgia Institute of Technology & Emory University, Georgia, USA; Hawkeye Radiology Informatics, Department of Radiology, College of Medicine, University of Iowa, USA; Minnesota Supercomputing Institute, University of Minnesota, USA; Medical Image HPC & Informatics Lab. (MiHi Lab), University of Iowa, USA; University of North Dakota, USA; NDSU-CIIT Green Computing & Communications Lab., North Dakota S
