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

[NEW ALGORITHM] PANCAKE SORT #1702

Open
2 tasks done
surbhisharma004 opened this issue Nov 6, 2024 · 2 comments
Open
2 tasks done

[NEW ALGORITHM] PANCAKE SORT #1702

surbhisharma004 opened this issue Nov 6, 2024 · 2 comments

Comments

@surbhisharma004
Copy link
Contributor

surbhisharma004 commented Nov 6, 2024

Issue will be closed if:

  1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
  2. You propose an algorithm that is already present or has been mentioned in a previous issue.
  3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.


Name:

[NEW ALGORITHM] PANCAKE SORT ALGORITHM

About:

Propose a new algorithm to be added to the repository
Pancake Sort is a sorting algorithm that sorts an array by repeatedly "flipping" subarrays. In each step, it finds the largest unsorted element, flips it to the front, and then flips it again to its correct position. This process is repeated until the entire array is sorted. The algorithm is inspired by the idea of flipping a stack of pancakes to order them by size, with the largest pancake at the bottom.


Labels:

new algorithm, gssoc-ext, hacktoberfest, level1


Assignees:

  • Contributor in GSSoC-ext
  • Want to work on it
@surbhisharma004
Copy link
Contributor Author

@pankaj-bind please assign this issue to me.

@pankaj-bind
Copy link
Collaborator

assigned

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants