Selection and partial sorting algorithms

My Solutions to basic Algorithms and Data Structures

Selection techniques for particle data in VR environment with simple 6DOF point/stroke input.

A collection of free scripts for Adobe Illustrator

Algorithms for the selection of fluorescent reporters.

Boyer-Moore majority vote algorithm and Misra-Gries Summary for finding frequent elements, explained (Python code included).

Simulation-assisted scheduling Algorithm Selection (SimAS) approach for the dynamic selection of the most efficient dynamic loop scheduling technique under Perturbations

Implements and benchmarks optimal demonstration selection strategies for In-Context Learning (ICL) using LLMs. Covers IDS, RDES, Influence-based Selection, Se², and TopK+ConE across reasoning and classification tasks, analyzing the impact of example relevance, diversity, and ordering on model performance across multiple architectures.

Extended Cross-Population (ExP) Heatmap

This project contains a solution to the Travelling Salesman Person Problem and the 0/1 Knapsack Problem using a Genetic Algorithm with different customizations and setups.

Candidate selection using an iterative soft-thresholding algorithm

Fundamental using Algorithm in python

Data Science useful libraries, functions and classes.

C++ selection sort, insertion sort, bubble sort and merge sort execution time. Demo =>

Forward stagewise sparse regression estimation implemented for gretl.

🍀 Own proposal of Selection Algorithm: Logarithmic Weighted Random Selector; choose a random element of a list; but the closer the element is to the start is more probability to appear, based on logarithmic scale.

Inspired by Google's Foobar challenge. It automates secretive candidate selection based on online activity, provides timed coding challenges, and allows hiring managers to evaluate submissions

Selection Algorithms for Scala

Solve selection problem using prune and search or quick sort.

Master Thesis

Selection algorithm with O(n log n) worst-case runtime

Master Thesis

Synastry-optimized crew selection model for Mars missions — 14.8% projected conflict reduction

Spring 2022 - 2023 Algorithms Assignments

Java code for randomized and deterministic QuickSelect algorithms, as well as a naive sorting algorithm. QuickSelect provides efficient selection of specific elements within an unsorted array. The code includes both randomized and deterministic pivot selection strategies comparing with naive built-in implementation.

Demonstration of the mini-lab component activities conducted for the course of Problem Solving and Algorithmic Thinking (19CSE100).

Genetic Algorithms

Sabanci University Fall 2020-2021 CS 301 (Algorithms) Problems

The Smith Method

Implementation of the algorithm in: E. L. G. Saukas and S. W. Song. , "A Note on Parallel Selection on Coarse-Grained Multicomputers", Algorithmica (1999)