Skip to main content

List and Tuple in PYTHON

First of all, do you know what is a 'list' ??

If no, then don't worry and if yes congratulations !

List :-  A number of connected items or names written or printed consecutively, typically one below the other .

Tuple :-  A tuple is a collection which is ordered and unchangable . But lists are changable .


So now defining each of the above in a detailed manner, so that everyone could understand and after that we will implement these in our programme.

1.) LISTS

Python lists are the containers to store a set of values of any type of data (int, str, float, boolean). For example:- If 'myname' is the name of that list and its components are Rohan, Mohan, Ram and John. So the code to write it is as follow :-

myname  =  ['Rohan', 'Mohan', 'Ram', 'John']

Another examples :-

mynums  =  [4, 2, 97, -43, 0]

mylist  =  [5, 0.33, 'Veer', 1]

Hope you understand how to write a list in python. Now talking about list indexing.

If we have a list named 'mynums' and

mynums  =  [4, 8, 2, 78, 9] ; here we have our first element is 4, second element is 8. So we can write

mynum[1]  =  4

mynum[3]  =  2


Now we will talk about list methods like max, min, sort, append, reverse, pop, remove .

So using max method, we can print the maximum number present in the list. By using min method, we can find the minimum number present in the list. By using sort method, our list get sorted and is printed as increasing order. By using reverse method, our list got reverted means first element becomes last and last becomes first etc. By using pop method, element at the last is deleted from the list. By using remove method, the element of our choice can be deleted.

So, lets start their implementation.




Now using the methods :-













2.) TUPLES

Tuples are the immutable data types in python. Immutable means which can't be changed.
For examples :

mytuple  =  ( ) ==> Empty Tuple

mytuple  =  (4, ) ==> Tuple with one element needs comma 

mytuple  =  (4, 2, 8, 6) ==> Tuple with more than one element

Once tuple is defined it can't be manipulated or update.

It means append, pop, remove, sort etc methods won't work on tuple because the reason is tuples are immuatable.
If a tuple is once defined no one can change it or update it.




Hope you like this tutorial. Please share it with your friends.

In our next tutorial, we will learn about sets and dictionary.


John Veer
Contact mail id - john.veer.utube@gmail.com
Thanks for reading !

Comments

Post a Comment

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

Queues in PYTHON

  The Python Code for Queue is here :- class Node: def __init__(self, data): self.data = data self.next = None class Queue: def __init__(self): self.front = self.rear = None def enqueue(self, data): newnode = Node(data) newnode.next = self.rear self.rear = newnode if self.front is None: self.front = newnode def dequeue(self): temp = self.rear while temp.next is not self.front: temp = temp.next self.front = temp temp.next = None def traverse(self): temp = self.rear while temp is not None: print(temp.data, end = " --> ") temp = temp.next print("None") new = Queue() new.enqueue(4) new.enqueue(1) new.enqueue(0) new.enqueue(2) new.traverse() new.dequeue() new.traverse() new.dequeue() new.traverse() 2 --> 0 --> 1 --> 4 --> None 2 --> 0 --> 1 --> None 2 ...
1 comment
Read more