Skip to Main Content
IBM Z Software


This portal is to open public enhancement requests against IBM Z Software products. To view all of your ideas submitted to IBM, create and manage groups of Ideas, or create an idea explicitly set to be either visible by all (public) or visible only to you and IBM (private), use the IBM Unified Ideas Portal (https://ideas.ibm.com).


Shape the future of IBM!

We invite you to shape the future of IBM, including product roadmaps, by submitting ideas that matter to you the most. Here's how it works:

Search existing ideas

Start by searching and reviewing ideas and requests to enhance a product or service. Take a look at ideas others have posted, and add a comment, vote, or subscribe to updates on them if they matter to you. If you can't find what you are looking for,

Post your ideas
  1. Post an idea.

  2. Get feedback from the IBM team and other customers to refine your idea.

  3. Follow the idea through the IBM Ideas process.


Specific links you will want to bookmark for future use

Welcome to the IBM Ideas Portal (https://www.ibm.com/ideas) - Use this site to find out additional information and details about the IBM Ideas process and statuses.

IBM Unified Ideas Portal (https://ideas.ibm.com) - Use this site to view all of your ideas, create new ideas for any IBM product, or search for ideas across all of IBM.

ideasibm@us.ibm.com - Use this email to suggest enhancements to the Ideas process or request help from IBM for submitting your Ideas.

Status Delivered
Workspace PL/I Compilers
Created by Guest
Created on Sep 1, 2017

Add QUICKSORT and QUICKSORTX built-in functions

We would like to have sort algorithms like quick sort available in PL/I for any array:
- As QUICKSORT using a simple compare.
- As QUICKSORTX using a specific compare function.

Idea priority Low
  • Guest
    Reply
    |
    Dec 12, 2017

    this has been delivered with the 5.2 update of 12 Dec

  • Guest
    Reply
    |
    Sep 20, 2017

    while PLISRT* are very good, they are also rather heavyweight. Having a quicksort function would be very useful for when PLISRT is overkill. It also is a good parallel to BINSEARCH

  • Guest
    Reply
    |
    Sep 2, 2017

    What's wrong with using the existing PLISORTx builtin functions?