Git Product home page Git Product logo

data-structures-algorithms-dsa-'s Introduction

Hi there, I'm Sayan

GIF


I'm a Student and currently learning EVERYTHING ๐Ÿ˜‚

  • ๐Ÿ”ญ A Tech && Space Enthusiast and currently doing open source contribution

  • โšก Fun fact: I love to play Guitar

  • ๐Ÿ’ฌ Ask me anything about Tech & Anime except HTML๐Ÿ˜ฌ


Languages and Tools:

cpp

NodeJS

NestJS

SQL

postgres

docker

Git

Ubuntu

Terminal

Heroku

Photoshop

Cloud




data-structures-algorithms-dsa-'s People

Contributors

agnihotri099 avatar godofgeeks23 avatar jamesfloyd-pen avatar kushjaggi avatar saatvik-droid avatar sai1188 avatar sayand0122 avatar sneha-meto avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

data-structures-algorithms-dsa-'s Issues

Python sorting bugs

Suppose 'a' is a list. a.sort() will sort the list a within itself. So a1 = a.sort() is an issue as a is sorted as well as a1 and the algorithm is never tested.

I can do a pull request in a couple of days to fix that if that helps.

Add more Algorithm

Add more algorithm in specified languages that are not already present. If you would like to put codes in different language feel free to open a new issue.

Sorting Programs - Java DSA

Add Sorting Programs in Java Language

  • Bubble Sort: A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

  • Selection Sort: It sorts an array by repeatedly finding the minimum element from the unsorted part and putting it at the beginning.

  • Insertion Sort: This algorithm builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

  • Merge Sort: A divide and conquer algorithm that divides an array into two halves, sorts them, and then merges the sorted halves to produce a single sorted array.

  • Quick Sort: A divide and conquer algorithm that picks an element as a pivot and partitions the given array around the chosen pivot.

  • Heap Sort: A comparison-based sorting algorithm that uses a binary heap data structure to build a max-heap or min-heap and then sorts the array.

  • Counting Sort: It is a non-comparative sorting algorithm. Instead of comparing elements, it counts the number of occurrences of each element and uses that information to reconstruct the sorted array.

  • Radix Sort: A non-comparative sorting algorithm that sorts data with integer keys by grouping keys with the same values.

  • Bucket Sort: It works by distributing the elements into a number of buckets and then sorting each bucket individually.

  • Tim Sort: A hybrid sorting algorithm derived from merge sort and insertion sort. It is used in Java's Arrays.sort() method for objects that implement the Comparable interface.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.