13.3 sort() and sorted() function
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full Mock Tests:
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
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: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.

