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 COBOL Compilers
Created by Guest
Created on Jul 7, 2015

Cobol 5 Sort Table in-place

Sort in Enterprise COBOL 5.2 does not sort in-place when sorting an array in storage, but instead allocates a work copy of the array to perform the sorting and allocates additional storage as well.
This is inefficient and unsuitable when used with large arrays. Cobol5 should use state-of-the-art algorithms like quicksort (citation from wikipedia: Quicksort can operate in-place on an array, requiring small additional amounts of memory to perform the sorting.)

We already opened a pmr and were advised to open a RFE:
<cite>
It's true that the runtime has to allocate additional memory in order to do the sort. This is by design. There are various sort algorithms which differ in how much memory is required and how well they perform (usually a trade-off between the two). If there is a customer requirement to provide a table sort that uses less memory (likely at the cost of performance) we can consider that for a future release.
</cite>

Idea priority Medium
  • Guest
    Reply
    |
    Mar 8, 2016

    This is available in V6.1

  • Guest
    Reply
    |
    Nov 25, 2015

    This RFE has been put into plan.

  • Guest
    Reply
    |
    Sep 14, 2015

    Due to processing by IBM, this request was reassigned to have the following updated attributes:
    Brand - Servers and Systems Software
    Product family - Programming Languages
    Product - COBOL Compilers

    For recording keeping, the previous attributes were:
    Brand - Rational
    Product family - Design & development
    Product - COBOL Compilers

  • Guest
    Reply
    |
    Aug 4, 2015

    Thanks for opening this RFE. This RFE will be accepted as a requirement to improve the memory footprint of the existing table sort algorithm. Please let us know if you have any concerns/question. RFE will be updated once it has been put into plan.