Skip to main content

Merge Sort Version 1.0

About the code it is called merge sort program written in Java. Merge sort is another sorting algorithm the is widely used in arranging numbers and strings. It was developed by Dr. John Von Neumann in 1945. I intended this code for beginners who are new in sorting algorithm construction and uses it in a practical manner. If you find this code useful send me an email at [email protected]

Insertion Sort Version 1.0

About this code I called this one insertion sort it is another sorting algorithm in computer science that is widely used to sort numbers and strings. I created this program to give insights on how to use and how it works. I hope this will help somebody who wish to learn sorting algorithms using Java as their tool in software development. If you like this code and find it useful send me an email at

Palindrome Determiner Version 1.0

About this code I called this program Palindrome Determiner Version 1.0 what it does it checks the word provided by the user whether the word is a palindrome or not a palindrome. To give you an insights a palindrome is a word that when reverse it the spelling is still the same as in its original form. For example: radar when you read it backwards its still radar. If you find my code useful send me

Bubble Sort Version 1.0

Hi Everyone this is my first time to submit and create a bubble sort program using C language. It's kinda challenging one for me at first but I was able to figure it how it works. Bubble sort algorithm works by comparing adjacent values to another. After it compares it swaps the adjacent values after it determines which values is higher from one another. Bubble sort is one of the simpliest form of