Re: need an algo for string sorting
From: Thad Smith (thadsmith_at_acm.org)
Date: 08/19/04
- Next message: Paul E. Black: "Re: need an algo for string sorting"
- Previous message: William: "Re: need an algo for string sorting"
- In reply to: Raghavendra Mahuli: "need an algo for string sorting"
- Next in thread: Paul E. Black: "Re: need an algo for string sorting"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Thu, 19 Aug 2004 10:20:30 -0600
Raghavendra Mahuli wrote:
> I have many strings. I have to sort them.
> ...
> But the complex part is "equivalent-values". it can be defined that "ai" and
> "ae" are equivalent-values. Then, while sorting two strings, i have to
> consider that "ai" and "ae" are equal......only if they come at same
> position in both the strings....
> For EX1:
> str1 - dfahaesdhfkj
> str2 - dfahaisds
> In str1, ae appears at position 4 and 5
> In str2, ai appears also at position 4 and 5....
>
> So they are equivalent.....And i can replace ae in str1 with ai......
>
> EX2:
> str3 - haehasdg
> str4 - hhsdaiskdn
> In str3, ae appears at position 1 and 2
> In str4, ai appears also at position 4 and 5....
> So here the rule "equivalent -values" does not apply......So i cant
> replace "ae" in str3 with "ai".......
>
> In short, the "equivalent-values" applies only when the
> "position-matches"...
>
> To add to that such equivalent values are many......
> So can you please suggest me some way of solving this problem ....
How do haem, haim, and hagm sort?
If equivalent values only apply when position matches, then
haem < hagm since there is no position match of equiv
haem = haim equiv position
hagm < haim no position match
That does not yield a strict ordering of the input strings. You need a
different means of ordering based on equivalent values. You can't solve
the problem until you resolve this issue.
The problem sounds like undeclared homework, so here are some general
approaches (after you solve the above problem):
1. Use a comparison function that compares character by character,
checking each for possible initial character of a combined value.
2. Another way would be to transform the original strings into a sort
index string which takes into account the special combinations.
Thad
- Next message: Paul E. Black: "Re: need an algo for string sorting"
- Previous message: William: "Re: need an algo for string sorting"
- In reply to: Raghavendra Mahuli: "need an algo for string sorting"
- Next in thread: Paul E. Black: "Re: need an algo for string sorting"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
