Member Avatar for tarekwarak

Hi ;
can any one help me to find the algorithm written in c# to convert boolean query form post-fix to infix notation like
example :
infix : Tony and George
post-fix : Tong George and
example 2 :
infix : Tony and George or Lona
post-fix : Tong George and Lona or

  • 2 Contributors
  • 1 Reply
  • 81 Views
  • 1 Day Discussion Span
  • Latest Post Latest Post by Antenka
Member Avatar for Antenka

I guess, one of the easiest things is Bubble Sort. It shall do this trick ;)

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.