What i have learned in this week?

• Selection Sort

• Time Complexity Basics

What is Selection Sort?

Selection Sort i an Sorting algorithm method which is useful to Sort the numbers in ascending or descending order

How it is Working?

• We want to run two loops one is outer loop and another one is inner loop which runs n-i times

• select the maximum number in the array of n-i

• swap it with the last index of n-i

What is Time Complexity?

Time Complexity is the method which is useful to find approx time that taken to run the code

Why it is Important?

• By Knowing this we can write the code to work Efficiently

• The code will be in control

Difficulties I Gone Through ?

• I difficult To find the maximum number for every j-n-i

• While Swap i fail to think the correct logic

How I overcome from That ?

• Maximum i try to solve a problem on my own when i fail I approach These Techniques

• Chat Gpt helped me here i Shared my code ask it to explain and solve the answer it give me the answer and also explain to me and i also understand that thing

• Some times Chat Gpt also can’t explain to me clearly at that time watch rhe video tutorial

Tools Helped..

1. You Tube

2. Chat Gpt

3. Play it (for video quality issues)

Resources i used ?

You Tube

1. For Selection Sort - Kunal Kushwaha DSA Play list Videos

2. For Time Complexity - Code io