ivsvarma

ai-agent-with-groq-and-tavily-search

ai-webscraper---understand-the-content

api_for_ml_heroko

deploying ML model API in hereko

automation--of-pod-ai-using-selenium

This project aims to automate interactions with a campus job portal using Selenium WebDriver and enhance functionality with AI capabilities. The goal is to streamline tasks such as job searching, application submission, and profile updates, making the job-hunting process more efficient for students.

bajajfin

barcode-detection-

Develop a real-time barcode scanner that captures video from a webcam, decodes barcodes, and verifies if the decoded barcode data is authorized based on a predefined list.

binary-search

Binary Search is defined as a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N).

Bone_fracture_detection_yolov8

Bubble-sort

covid-bed-management-system

ivsvarma/automation--of-pod-ai-using-selenium

This project aims to automate interactions with a campus job portal using Selenium WebDriver and enhance functionality with AI capabilities. The goal is to streamline tasks such as job searching, application submission, and profile updates, making the job-hunting process more efficient for students.

ivsvarma/ai-agent-with-groq-and-tavily-search

ivsvarma/ai-webscraper---understand-the-content

ivsvarma/api_for_ml_heroko

deploying ML model API in hereko

ivsvarma/bajajfin

ivsvarma/barcode-detection-

Develop a real-time barcode scanner that captures video from a webcam, decodes barcodes, and verifies if the decoded barcode data is authorized based on a predefined list.

ivsvarma/binary-search

Binary Search is defined as a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N).

ivsvarma/Bone_fracture_detection_yolov8

ivsvarma/Bubble-sort

ivsvarma/covid-bed-management-system

ivsvarma/Chat-bot-using-Deepseek-r1-and-langchain

ivsvarma/finding-maximum-and-minimum-in-an-array

ivsvarma/firstandfollow

ivsvarma/Insertion-Sort

The main idea behind insertion sort is that it inserts each item into its proper place in the final list. To save memory, most implementations of the insertion sort algorithm work by moving the current data element past the already sorted values and repeatedly interchanging it with the preceding value until it is in its correct place.

ivsvarma/linear-searc

ivsvarma/linear-search

ivsvarma/maximum-sub-array

ivsvarma/merge-sort

Merge Sort is one of the most popular sorting algorithms that is based on the principle of Divide and Conquer Algorithm.

ivsvarma/Missionaries-and-Cannibals

This repository contains a Python implementation of the Missionaries and Cannibals problem, a classic river-crossing puzzle.

ivsvarma/movie-recommender-system

ivsvarma/music-genre-classification-

ivsvarma/Parkingslot-cal

ivsvarma/quick-sort

QuickSort is a sorting algorithm based on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.

ivsvarma/spotifyclone

ivsvarma/strassen-matrix-multiplication

Strassen’s Matrix Multiplication is the divide and conquer approach to solve the matrix multiplication problems. The usual matrix multiplication method multiplies each row with each column to achieve the product matrix. The time complexity taken by this approach is O(n3), since it takes two loops to multiply

ivsvarma/talk-with-ai-llm

ivsvarma/todolist

ivsvarma/weather-finder-

weather finder using open weather api