Feature Selection Library for Data Sciences in Python

visualize some algorithms with java-swing

This repository provides Python implementations of two fundamental search algorithms: Sequential Search and Binary Search. It includes detailed and easy-to-understand code for both algorithms, showcasing their functionality, use cases, and performance differences.

Content developed throughout the Data Structures and Algorithms II course in the second semester of the Computer Science program at PUC Minas, including exercises, activities, and other implementations.

In this project, we focus on different ways to optimize a machine learning model parameters.

Search and sorting algorithms

The repository was created to host laboratory work on the university subject of the 2nd year of the specialty Software Engineering of PSU

LAB 03 – BÚSQUEDA

Busca Indexada com dois índices - Indexed Search with two indexes (C)

A graphical representation of how bubble sort works, coded in Java.

Busca Binária e sequencial. Ordenação: BubbleSort, SelectSort, QuickSort

Collections of Java classes with some algorithms that may be useful in certain contexts and applications

Repository containing all the activities and tasks completed in the "Estructura de Datos" course. Covered topics include ADTs, recursion, lists, graphs, stacks, sorting methods such as shell sort, radix sort, bubble sort, quicksort, intercalation sort, direct merge sort, natural merge sort, as well as search methods: binary, hash and sequential.

This code was a homework which goal was to implement some of the most popular sorting and search algorithms in order to know how to use them.

Compare 3 simple search algorithms and their running time growths in Big-O notations

:mag: sequential search ==> recursive algorithm in javascript

A chunk of code that shows a sequential search.

Comparing a sequential program and a parallel program doing the same task