1

Topic: Sorting of the big data in with Haskell

As generally in Haskele it is possible to sort the big data in  if . Not , it is necessary to create structures ? For example, if I want shellsort on the big array I need to create many auxiliary arrays in the course of a recursion since I cannot is simple  elements in places in the list.

2

Re: Sorting of the big data in with Haskell

Hello, WinnieJayClay, you wrote: WJC> As generally in Haskele it is possible to sort the big data in  if . Structures not  lens https://github.com/ekmett/lens/wiki/Overview

3

Re: Sorting of the big data in with Haskell

Hello, WinnieJayClay, you wrote: WJC> As generally in Haskele it is possible to sort the big data in  if . Not , it is necessary to create structures ? For example, if I want shellsort on the big array I need to create many auxiliary arrays in the course of a recursion since I cannot is simple  elements in places in the list. If really there is a necessity to sort the big data in storage it is better to use not the list, and any of arrays in a suitable monad https://wiki.haskell.org/Arrays.

4

Re: Sorting of the big data in with Haskell

Hello, jazzer, you wrote: J> Hello, WinnieJayClay, you wrote: WJC>> As generally in Haskele it is possible to sort the big data in  if . Structures not  J> lens I do not think that lenses - the relevant tool for sorting of the big homogeneous structure. They are intended for operation with is difficult-branchy data types.

5

Re: Sorting of the big data in with Haskell

Hello, deniok, you wrote: D> I do not think that lenses - the relevant tool for sorting of the big homogeneous structure. They are intended for operation with is difficult-branchy data types. It agree, I am simple so understood an essence of a question of the HARDWARE that he is interested how to be with the big not modified data, without taking copies of all and all on each step.

6

Re: Sorting of the big data in with Haskell

Hello, WinnieJayClay, you wrote: WJC> As generally in Haskele it is possible to sort the big data in  For example by means of packets vector and vector-algorithms WJC> if . Not , it is necessary to create structures ? For example, if I want shellsort on the big array I need to create many auxiliary arrays in the course of a recursion since I cannot is simple  elements in places in the list. It is possible to use modified structures.