-
-
Notifications
You must be signed in to change notification settings - Fork 46.6k
Create sorted_linked_list.py #11847
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
Create sorted_linked_list.py #11847
Conversation
Python code to sort the numbers using linked list algorithm in data structures
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper
commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper review
to trigger the checks for only added pull request files@algorithms-keeper review-all
to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
@@ -0,0 +1,46 @@ | |||
class Node: | |||
def __init__(self, data): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide return type hint for the function: __init__
. If the function does not return a value, please provide the type hint as: def function() -> None:
Please provide type hint for the parameter: data
self.next = None | ||
|
||
class SortedLinkedList: | ||
def __init__(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide return type hint for the function: __init__
. If the function does not return a value, please provide the type hint as: def function() -> None:
def __init__(self): | ||
self.head = None | ||
|
||
def insert(self, data): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide return type hint for the function: insert
. If the function does not return a value, please provide the type hint as: def function() -> None:
As there is no test file in this pull request nor any test function or class in the file data_structures/linked_list/sorted_linked_list.py
, please provide doctest for the function insert
Please provide type hint for the parameter: data
new_node.next = current.next | ||
current.next = new_node | ||
|
||
def display(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide return type hint for the function: display
. If the function does not return a value, please provide the type hint as: def function() -> None:
As there is no test file in this pull request nor any test function or class in the file data_structures/linked_list/sorted_linked_list.py
, please provide doctest for the function display
for more information, see https://pre-commit.ci
This is a duplicate PR of #11607 please check |
Closing require_type_hints PRs to prepare for Hacktoberfest |
Python code to sort the numbers using linked list algorithm in data structures
Describe your change:
1. Node Class: Represents an element in the linked list.
2. SortedLinkedList class: Manages the insertion of elements and ensures they are sorted.
3. insert method: Inserts a node at the appropriate position to maintain order.
4. display method: prints the linked list.
Closes #11768
Checklist: