It is a simple made-by-me minimax algorithm fitted into a game of tic-tac-toe. It is written in Python and does not use any libraries that need to be installed via pip. Idea was to try writing more of ...

Abstract: We present a hardware-algorithm for sorting N elements using either a p-sorter or a sorting network of fixed I/O size p while strictly enforcing conflict-free memory accesses. To the best of ...

One of the best NEH improvements are the N-NEH and N NEH + construction heuristics that use the N-list technique in the insertion phase of the NEH algorithm ... Therefore, in this paper, we propose ...

This project demonstrates the implementation and comparison of Insertion Sort and Merge Sort using Python. You can take user input or test the algorithms on a predefined array.