Skip to content

Final Lab Tasks for the course Design and Analysis of Algorithms at SSUET. This repository contains implementations of basic sorting and searching algorithms as part of hands-on lab exercises.

Notifications You must be signed in to change notification settings

Sidra-009/Final_Lab-Design-and-Analysis-of-Algorithms-

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 

Repository files navigation

🧠 Design and Analysis of Algorithms - Final Lab Tasks

This repository contains the final lab assignments completed for the Design and Analysis of Algorithms (DAA) course. The tasks demonstrate the implementation of fundamental algorithmic techniques using Python.


📂 Contents

✅ Task 1 - Bubble Sort with Swap Count

  • Sorts a list of student scores in both ascending and descending order.
  • Implements Bubble Sort algorithm.
  • Counts the number of swaps made during the sorting process.
  • Includes an optimization to stop early if the list is already sorted.

📌 Key Concepts:

  • Bubble Sort
  • Conditional Swapping
  • Early Termination
  • Sorting Order Control

✅ Task 2 - Product Search by Name

  • Takes product names and prices as input from the user.
  • Implements a Linear Search to find a product by name.
  • Displays product details and its position if found.

📌 Key Concepts:

  • Linear Search
  • Tuple Handling
  • Case-Insensitive Matching

💡 How to Run

  1. Clone the repository:
    git clone https://github.com/Sidra-009/DAA-Final-Lab-Tasks.git cd DAA-Final-Lab-Tasks python task1_bubble_sort.py python task2_product_search.py 

About

Final Lab Tasks for the course Design and Analysis of Algorithms at SSUET. This repository contains implementations of basic sorting and searching algorithms as part of hands-on lab exercises.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages