13.3 sort() and sorted() function

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/python-language/collections-strings/lists/asset-133-sort-and-sorted-function after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. HPSC Interview Preparation: Interview Preparation
  2. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends
  13. Digital Society & Cyber Law: Society, Law & Ethics
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive comparison of two Python sorting methods: the list method `sort()` and the built-in function `sorted()`. The lecture begins by introducing the `sort()` method, defining it as a list method that modifies the original list in-place and sorts elements in ascending order by default. The instructor demonstrates this with a code example using a list of numbers, showing the original list being altered. The video then transitions to the `sorted()` function, explaining that it returns a new sorted list without modifying the original, and can work on any iterable, including tuples and strings. A code example demonstrates sorting a tuple, which requires converting the result back to a tuple. The lesson concludes with a summary table that contrasts the two methods on key features such as type, return value, and the data they work on, emphasizing that `sort()` is a method for lists only, while `sorted()` is a versatile function for any iterable.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title slide showing the text 'sort(), sort()'. The instructor then introduces the 'sort() - List Method' on a digital blackboard. The slide provides a definition: 'sort() is a list method', 'It modifies the original list', and 'Sorts elements in ascending order by default'. The instructor explains these points, emphasizing that the method changes the original list. The on-screen text clearly states that the method modifies the original list, which is a key characteristic being taught.

  2. 2:00 – 4:46 02:00-04:46

    The instructor transitions to the 'sorted() - Built-in Function' slide. The slide lists its features: it returns a new sorted list, the original list remains unchanged, and it works on any iterable (list, tuple, string). The instructor demonstrates this with a code example: `numbers = [40, 10, 30, 20]`, `new_list = sorted(numbers)`, `print(new_list)`, `print(numbers)`. The on-screen text shows the output `[10, 20, 30, 40]` for the new list and `[40, 10, 30, 20]` for the original, visually confirming the non-destructive nature of `sorted()`. The video then shows an example of sorting a tuple `t = (5, 2, 9, 1)`, with the code `print(sorted(t))` and the output `[1, 2, 5, 9]`, illustrating that `sorted()` can handle tuples. The final slide presents a comparison table, summarizing that `sort()` is a list method that modifies the original list and returns `None`, while `sorted()` is a built-in function that returns a new list and works on any iterable.

The video systematically teaches the difference between Python's `sort()` method and `sorted()` function. It first establishes that `sort()` is a method that operates directly on a list, modifying it in-place, which is useful when the original order is not needed. It then introduces `sorted()` as a more flexible, non-destructive function that creates a new list, preserving the original. The core lesson is the trade-off: use `sort()` for efficiency when you want to change the original list, and use `sorted()` when you need to keep the original data intact or when working with non-list iterables. The comparison table at the end effectively consolidates these key differences for the learner.

Loading lesson…