User talk:Ajay raj sh

Your submission at Articles for creation: Prim's Algorithm (Binary Heap Implementation) (October 27)

Your recent article submission to Articles for Creation has been reviewed! The submission has not been accepted because it included copyrighted information, which is not permitted on Wikipedia. You are welcome to write an article on the subject, but please do not use copyrighted work.

The existing submission may be deleted at any time. Copyrighted work cannot be allowed to remain on Wikipedia.

If you need any assistance, you can ask for help at the Articles for creation help desk or on the reviewer's talk page.
You can also get real-time chat help from experienced editors.

Rankersbo (talk) 20:04, 27 October 2014 (UTC)[reply]

Hello! Ajay raj sh, I noticed your article was declined at Articles for Creation, and that can be disappointing. If you are wondering or curious about why your article submission was declined please post a question at the Articles for creation help desk. If you have any other questions about your editing experience, we'd love to help you at the Teahouse, a friendly space on Wikipedia where experienced editors lend a hand to help new editors like yourself! See you there! Rankersbo (talk) 20:04, 27 October 2014 (UTC)[reply]

Binary heaps for Minimum Spanning Tree

This is an automated message from CorenSearchBot. I have performed a web search with the contents of Binary heaps for Minimum Spanning Tree, and it appears to include material copied directly from http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-mst-for-adjacency-list-representation/.

It is possible that the bot is confused and found similarity where none actually exists. If that is the case, you can remove the tag from the article. The article will be reviewed to determine if there are any copyright issues.

If substantial content is duplicated and it is not public domain or available under a compatible license, it will be deleted. For legal reasons, we cannot accept copyrighted text or images borrowed from other web sites or printed material. You may use such publications as a source of information, but not as a source of sentences. See our copyright policy for further details. (If you own the copyright to the previously published content and wish to donate it, see Wikipedia:Donating copyrighted materials for the procedure.) CorenSearchBot (talk) 15:40, 4 November 2014 (UTC)[reply]

Speedy deletion nomination of Binary heaps for Minimum Spanning Tree

If this is the first article that you have created, you may want to read the guide to writing your first article.
You may want to consider using the Article Wizard to help you create articles.

A tag has been placed on Binary heaps for Minimum Spanning Tree requesting that it be speedily deleted from Wikipedia. This has been done under section G12 of the criteria for speedy deletion, because the article or image appears to be a clear copyright infringement. This article or image appears to be a direct copy from http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-mst-for-adjacency-list-representation/. For legal reasons, we cannot accept copyrighted text or images borrowed from other web sites or printed material, and as a consequence, your addition will most likely be deleted. You may use external websites as a source of information, but not as a source of sentences. This part is crucial: say it in your own words. Wikipedia takes copyright violations very seriously and persistent violators will be blocked from editing.

If the external website or image belongs to you, and you want to allow Wikipedia to use the text or image — which means allowing other people to modify it — then you must verify that externally by one of the processes explained at Wikipedia:Donating copyrighted materials. If you are not the owner of the external website or image but have permission from that owner, see Wikipedia:Requesting copyright permission. You might want to look at Wikipedia's policies and guidelines for more details, or ask a question here.

If you think this page should not be deleted for this reason, you may contest the nomination by visiting the page and clicking the button labelled "Click here to contest this speedy deletion". This will give you the opportunity to explain why you believe the page should not be deleted. However, be aware that once a page is tagged for speedy deletion, it may be removed without delay. Please do not remove the speedy deletion tag from the page yourself, but do not hesitate to add information in line with Wikipedia's policies and guidelines. --Richard Yin (talk) 15:54, 4 November 2014 (UTC)[reply]

Removing AfD template

Welcome to Wikipedia. Please do not remove Articles for deletion notices from articles, or remove other people's comments in Articles for deletion debates, as you did with Marriage Bazaar. Otherwise, it may be difficult to create consensus. If you oppose the deletion of an article, please comment at the respective page instead. This is an automated message from a bot about this edit, where you removed the deletion template from an article before the deletion discussion was complete. If this message is in error, please report it.—cyberbot I ^Notify_Online 19:39, 6 November 2014 (UTC)[reply]

Removing AfD template

Please do not remove Articles for deletion notices from articles or remove other people's comments in Articles for deletion pages, as you did with Marriage Bazaar. Doing so won't stop the discussion from taking place. You are, however, welcome to comment about the proposed deletion on the appropriate page. This is an automated message from a bot about this edit, where you removed the deletion template from an article before the deletion discussion was complete. If this message is in error, please report it.—cyberbot I ^Notify_Online 09:34, 14 November 2014 (UTC)[reply]