Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Prajaktakap00r patch 2 #115

Open
wants to merge 3 commits into
base: main
Choose a base branch
from

Conversation

prajaktakap00r
Copy link

Hi

This sorting technique works by comparing the consecutive elements and swapping them

The time complexity is O(n^2)
This code is for circular linked list. Circular linked list is a type of linked list is which last node next does not point to null but it point to head. There is no end of this linked list
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant