Skip to main content

Disclaimer

 

Disclaimer for John Veer

If you require any more information or have any questions about our site's disclaimer, please feel free to contact us by email at john.veer.utube@gmail.com. Our Disclaimer was generated with the help of the Disclaimer Generator.

Disclaimers for Basic Python Programme

All the information on this website - www.basicpythonprogramme.blogspot.com - is published in good faith and for general information purpose only. Basic Python Programme does not make any warranties about the completeness, reliability and accuracy of this information. Any action you take upon the information you find on this website (Basic Python Programme), is strictly at your own risk. Basic Python Programme will not be liable for any losses and/or damages in connection with the use of our website.

From our website, you can visit other websites by following hyperlinks to such external sites. While we strive to provide only quality links to useful and ethical websites, we have no control over the content and nature of these sites. These links to other websites do not imply a recommendation for all the content found on these sites. Site owners and content may change without notice and may occur before we have the opportunity to remove a link which may have gone 'bad'.

Please be also aware that when you leave our website, other sites may have different privacy policies and terms which are beyond our control. Please be sure to check the Privacy Policies of these sites as well as their "Terms of Service" before engaging in any business or uploading any information.

Consent

By using our website, you hereby consent to our disclaimer and agree to its terms.

Update

Should we update, amend or make any changes to this document, those changes will be prominently posted here.

Comments

New comments are not allowed.

Popular posts from this blog

Bubble Sort Algorithm in PYTHON

What is Bubble Sort ? And why do we need this ? Bubble sort is the simplest algorithm to sort any array. Due to its simplicity, bubble sort is often used to introduce the concept of a sorting algorithm.  In computer graphics it is popular for its capability to detect a very small error (like swap of just two elements) in almost-sorted arrays and fix it with just linear complexity (2n). For example, it is used in a polygon filling algorithm, where bounding lines are sorted by their x coordinate at a specific scan line (a line parallel to x axis) and with incrementing y their order changes . ALGORITHM :- 1.) Firstly we have an unsorted list, which is to be sorted. 2.) Consider the first element of the list. Then compare it with the next element. 3.) If the second element is greator than the first element than swap them. 4.) If the second element is smaller than the first element, then we don't have to do anything. 5.) Going ahead, now after swap (may or may not), look for second...
Post a Comment
Read more

Merge Sort Algorithm in PYTHON

  First of all, Why do we need to learn so many sorting algorithms? We need to learn so many sorting algorithms because there are cases in which which algorithm fits best. According to the time complexity, we have to choose an algorithm of our use. That's why we are learning so many sorting algorithms. SO LETS START WITH THE MERGE SORT In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. It is one of the most popular algorithms and one of the most stable sorting algorithm. ALGORITHM 1.) First of all take a list and put it in a function (recursion) that it breaks itself into two halves. 2.) When we get the two halves, the recursion code will automatically breaks the two halves into four             parts and then into 8 parts until each...
Post a Comment
Read more

Classes and Objects in PYTHON (Object Oriented Programming)

Solving a problem by creating objects is one of the most popular approach in programming. This is called Object Oriented Programming This concept is based on using reusable code but differently from functions. It is based on DRY (Don't Repeat Yourself) Principle. CLASS :- A class is a blueprint for creating objects. It can described as a group of objects. Objects are the instances of a class. We will further define this in our upcoming code in this post. Lets see a basic program for the class and objects to understand it properly. class Students: pass #we have three students alok, vinay and aashish alok = Students() vinay = Students() aashish = Students() #there data is given as per alok.name = "Alok Kumar" alok.age = 17 alok.standard = "11 th" vinay.name = "Vinay Sharma" vinay.age = 18 vinay.standard = "12 th" aashish.name = "Aashish Mishra" aashish.age = 16 aashish.standard = "10 th" print(vinay) print(alok.a...
Post a Comment
Read more